/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-nonblocking-cntr.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:13:12,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:13:12,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:13:12,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:13:12,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:13:12,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:13:12,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:13:12,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:13:12,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:13:12,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:13:12,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:13:12,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:13:12,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:13:12,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:13:12,620 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:13:12,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:13:12,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:13:12,620 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:13:12,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:13:12,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:13:12,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:13:12,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:13:12,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:13:12,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:13:12,622 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:13:12,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:13:12,622 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:13:12,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:13:12,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:13:12,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:13:12,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:13:12,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:13:12,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:13:12,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:13:12,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:13:12,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:13:12,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:13:12,625 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:13:12,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:13:12,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:13:12,625 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:13:12,626 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 03:13:12,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:13:12,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:13:12,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:13:12,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:13:12,856 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:13:12,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-nonblocking-cntr.wvr_bound2.c [2023-08-04 03:13:13,922 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:13:14,127 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:13:14,127 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-nonblocking-cntr.wvr_bound2.c [2023-08-04 03:13:14,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b851f919c/69410617fa5e48dfa51fa508b58c5603/FLAGc93217454 [2023-08-04 03:13:14,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b851f919c/69410617fa5e48dfa51fa508b58c5603 [2023-08-04 03:13:14,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:13:14,149 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:13:14,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:13:14,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:13:14,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:13:14,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638d3f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14, skipping insertion in model container [2023-08-04 03:13:14,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,178 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:13:14,307 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-nonblocking-cntr.wvr_bound2.c[2199,2212] [2023-08-04 03:13:14,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:13:14,321 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:13:14,341 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-nonblocking-cntr.wvr_bound2.c[2199,2212] [2023-08-04 03:13:14,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:13:14,354 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 03:13:14,354 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 03:13:14,359 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:13:14,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14 WrapperNode [2023-08-04 03:13:14,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:13:14,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:13:14,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:13:14,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:13:14,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,386 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2023-08-04 03:13:14,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:13:14,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:13:14,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:13:14,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:13:14,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:13:14,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:13:14,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:13:14,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:13:14,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (1/1) ... [2023-08-04 03:13:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:13:14,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:14,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 03:13:14,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 03:13:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:13:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 03:13:14,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 03:13:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 03:13:14,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 03:13:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:13:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:13:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:13:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 03:13:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 03:13:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:13:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:13:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:13:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:13:14,487 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 03:13:14,595 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:13:14,597 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:13:14,785 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:13:14,818 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:13:14,818 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 03:13:14,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:13:14 BoogieIcfgContainer [2023-08-04 03:13:14,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:13:14,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:13:14,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:13:14,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:13:14,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:13:14" (1/3) ... [2023-08-04 03:13:14,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57465361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:13:14, skipping insertion in model container [2023-08-04 03:13:14,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:13:14" (2/3) ... [2023-08-04 03:13:14,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57465361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:13:14, skipping insertion in model container [2023-08-04 03:13:14,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:13:14" (3/3) ... [2023-08-04 03:13:14,828 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-nonblocking-cntr.wvr_bound2.c [2023-08-04 03:13:14,836 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:13:14,845 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:13:14,845 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 03:13:14,845 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:13:14,901 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 03:13:14,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 106 transitions, 234 flow [2023-08-04 03:13:15,031 INFO L124 PetriNetUnfolderBase]: 33/243 cut-off events. [2023-08-04 03:13:15,031 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 03:13:15,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 243 events. 33/243 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 794 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 134. Up to 8 conditions per place. [2023-08-04 03:13:15,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 106 transitions, 234 flow [2023-08-04 03:13:15,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 106 transitions, 234 flow [2023-08-04 03:13:15,054 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:13:15,068 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 106 transitions, 234 flow [2023-08-04 03:13:15,071 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 106 transitions, 234 flow [2023-08-04 03:13:15,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 106 transitions, 234 flow [2023-08-04 03:13:15,117 INFO L124 PetriNetUnfolderBase]: 33/243 cut-off events. [2023-08-04 03:13:15,117 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 03:13:15,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 243 events. 33/243 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 794 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 134. Up to 8 conditions per place. [2023-08-04 03:13:15,130 INFO L119 LiptonReduction]: Number of co-enabled transitions 2052 [2023-08-04 03:13:17,418 INFO L134 LiptonReduction]: Checked pairs total: 2590 [2023-08-04 03:13:17,418 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-08-04 03:13:17,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:13:17,437 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=LoopsAndPotentialCycles, 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;@1c01c63a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:13:17,437 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 03:13:17,443 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:13:17,443 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2023-08-04 03:13:17,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:13:17,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:17,444 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 03:13:17,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:13:17,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:17,449 INFO L85 PathProgramCache]: Analyzing trace with hash -105819538, now seen corresponding path program 1 times [2023-08-04 03:13:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162917445] [2023-08-04 03:13:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:13:17,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:13:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:13:17,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:13:17,591 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:13:17,592 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 03:13:17,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 03:13:17,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:13:17,594 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 03:13:17,597 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 03:13:17,598 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:13:17,598 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:13:17,620 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 03:13:17,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:17,732 INFO L124 PetriNetUnfolderBase]: 134/806 cut-off events. [2023-08-04 03:13:17,732 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 03:13:17,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 806 events. 134/806 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4073 event pairs, 1 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-04 03:13:17,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:17,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:17,745 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:13:17,745 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:17,746 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:17,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:17,824 INFO L124 PetriNetUnfolderBase]: 134/806 cut-off events. [2023-08-04 03:13:17,824 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 03:13:17,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 806 events. 134/806 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4073 event pairs, 1 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-04 03:13:17,841 INFO L119 LiptonReduction]: Number of co-enabled transitions 5028 [2023-08-04 03:13:20,205 INFO L134 LiptonReduction]: Checked pairs total: 7587 [2023-08-04 03:13:20,205 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-04 03:13:20,207 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:13:20,208 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=LoopsAndPotentialCycles, 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;@1c01c63a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:13:20,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 03:13:20,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:13:20,220 INFO L124 PetriNetUnfolderBase]: 7/67 cut-off events. [2023-08-04 03:13:20,222 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 03:13:20,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:20,223 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 03:13:20,224 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:13:20,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:20,225 INFO L85 PathProgramCache]: Analyzing trace with hash 115010471, now seen corresponding path program 1 times [2023-08-04 03:13:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:20,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316676603] [2023-08-04 03:13:20,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:13:20,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:20,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316676603] [2023-08-04 03:13:20,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316676603] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:20,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800989040] [2023-08-04 03:13:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:20,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:20,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:20,453 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) [2023-08-04 03:13:20,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 03:13:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:20,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 03:13:20,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:13:20,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:13:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800989040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:20,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:13:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 03:13:20,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111713115] [2023-08-04 03:13:20,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:20,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:13:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:20,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:13:20,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 03:13:20,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-04 03:13:20,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:20,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:20,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-04 03:13:20,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:21,524 INFO L124 PetriNetUnfolderBase]: 8553/11151 cut-off events. [2023-08-04 03:13:21,524 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2023-08-04 03:13:21,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22551 conditions, 11151 events. 8553/11151 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 50278 event pairs, 2448 based on Foata normal form. 0/6346 useless extension candidates. Maximal degree in co-relation 6846. Up to 10615 conditions per place. [2023-08-04 03:13:21,630 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 23 selfloop transitions, 5 changer transitions 17/52 dead transitions. [2023-08-04 03:13:21,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 234 flow [2023-08-04 03:13:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:13:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:13:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-08-04 03:13:21,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45493562231759654 [2023-08-04 03:13:21,646 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-08-04 03:13:21,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-08-04 03:13:21,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:21,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-08-04 03:13:21,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:21,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:21,667 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:21,669 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 5 states and 530 transitions. [2023-08-04 03:13:21,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 234 flow [2023-08-04 03:13:21,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:13:21,681 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 91 flow [2023-08-04 03:13:21,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-04 03:13:21,687 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-04 03:13:21,687 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 91 flow [2023-08-04 03:13:21,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:21,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:21,688 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 03:13:21,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:21,894 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 [2023-08-04 03:13:21,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:13:21,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:21,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1679197376, now seen corresponding path program 1 times [2023-08-04 03:13:21,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:21,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893822814] [2023-08-04 03:13:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:13:21,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:21,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893822814] [2023-08-04 03:13:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893822814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:21,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:13:21,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:13:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352637870] [2023-08-04 03:13:21,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:21,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:13:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:13:21,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:13:21,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-04 03:13:21,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:21,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:21,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-04 03:13:21,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:22,139 INFO L124 PetriNetUnfolderBase]: 1760/2333 cut-off events. [2023-08-04 03:13:22,140 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-08-04 03:13:22,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2333 events. 1760/2333 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8364 event pairs, 685 based on Foata normal form. 1/1402 useless extension candidates. Maximal degree in co-relation 1396. Up to 2189 conditions per place. [2023-08-04 03:13:22,155 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 21 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 03:13:22,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 140 flow [2023-08-04 03:13:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:13:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:13:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-08-04 03:13:22,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45350500715307585 [2023-08-04 03:13:22,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-08-04 03:13:22,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-08-04 03:13:22,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:22,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-08-04 03:13:22,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,162 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 91 flow. Second operand 3 states and 317 transitions. [2023-08-04 03:13:22,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 140 flow [2023-08-04 03:13:22,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 137 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:13:22,165 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 87 flow [2023-08-04 03:13:22,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-08-04 03:13:22,166 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 03:13:22,166 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 87 flow [2023-08-04 03:13:22,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:22,167 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:22,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 03:13:22,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:13:22,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1061111994, now seen corresponding path program 1 times [2023-08-04 03:13:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:22,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67659692] [2023-08-04 03:13:22,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:13:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67659692] [2023-08-04 03:13:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67659692] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293225556] [2023-08-04 03:13:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:22,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:22,225 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) [2023-08-04 03:13:22,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 03:13:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:22,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:13:22,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:13:22,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:13:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:13:22,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293225556] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:13:22,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:13:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:13:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329422842] [2023-08-04 03:13:22,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:13:22,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:13:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:22,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:13:22,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:13:22,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-04 03:13:22,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:22,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-04 03:13:22,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:22,530 INFO L124 PetriNetUnfolderBase]: 1432/1870 cut-off events. [2023-08-04 03:13:22,530 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-08-04 03:13:22,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 1870 events. 1432/1870 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6187 event pairs, 357 based on Foata normal form. 3/1117 useless extension candidates. Maximal degree in co-relation 2803. Up to 1729 conditions per place. [2023-08-04 03:13:22,543 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-04 03:13:22,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 150 flow [2023-08-04 03:13:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:13:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:13:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-04 03:13:22,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44527896995708155 [2023-08-04 03:13:22,546 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-04 03:13:22,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-04 03:13:22,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:22,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-04 03:13:22,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,550 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,550 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 87 flow. Second operand 4 states and 415 transitions. [2023-08-04 03:13:22,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 150 flow [2023-08-04 03:13:22,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:13:22,553 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 84 flow [2023-08-04 03:13:22,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-08-04 03:13:22,555 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2023-08-04 03:13:22,556 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 84 flow [2023-08-04 03:13:22,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:22,559 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:22,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:22,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 03:13:22,767 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:13:22,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1635488467, now seen corresponding path program 1 times [2023-08-04 03:13:22,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:22,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120714083] [2023-08-04 03:13:22,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 03:13:22,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:22,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120714083] [2023-08-04 03:13:22,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120714083] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:22,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103395300] [2023-08-04 03:13:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:22,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:22,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:22,862 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) [2023-08-04 03:13:22,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 03:13:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:22,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 03:13:22,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 03:13:22,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:13:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103395300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:22,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:13:22,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 03:13:22,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676221575] [2023-08-04 03:13:22,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:22,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:13:22,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:22,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:13:22,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 03:13:22,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-04 03:13:22,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:22,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:22,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-04 03:13:22,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:23,079 INFO L124 PetriNetUnfolderBase]: 1000/1330 cut-off events. [2023-08-04 03:13:23,079 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-08-04 03:13:23,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1330 events. 1000/1330 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4404 event pairs, 43 based on Foata normal form. 81/871 useless extension candidates. Maximal degree in co-relation 1017. Up to 558 conditions per place. [2023-08-04 03:13:23,083 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2023-08-04 03:13:23,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2023-08-04 03:13:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:13:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:13:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2023-08-04 03:13:23,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497854077253219 [2023-08-04 03:13:23,086 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 524 transitions. [2023-08-04 03:13:23,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 524 transitions. [2023-08-04 03:13:23,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:23,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 524 transitions. [2023-08-04 03:13:23,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:23,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:23,090 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:23,090 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 84 flow. Second operand 5 states and 524 transitions. [2023-08-04 03:13:23,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2023-08-04 03:13:23,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 03:13:23,092 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2023-08-04 03:13:23,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2023-08-04 03:13:23,092 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 03:13:23,092 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2023-08-04 03:13:23,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:23,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 03:13:23,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 03:13:23,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:23,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:23,299 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 03:13:23,300 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 03:13:23,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:23,363 INFO L124 PetriNetUnfolderBase]: 134/806 cut-off events. [2023-08-04 03:13:23,363 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 03:13:23,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 806 events. 134/806 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4073 event pairs, 1 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-04 03:13:23,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:23,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:23,368 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:13:23,368 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:23,368 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:23,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 129 transitions, 306 flow [2023-08-04 03:13:23,415 INFO L124 PetriNetUnfolderBase]: 134/806 cut-off events. [2023-08-04 03:13:23,415 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 03:13:23,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 806 events. 134/806 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4073 event pairs, 1 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-04 03:13:23,429 INFO L119 LiptonReduction]: Number of co-enabled transitions 5028 [2023-08-04 03:13:25,347 INFO L134 LiptonReduction]: Checked pairs total: 7551 [2023-08-04 03:13:25,347 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-04 03:13:25,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:13:25,350 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=LoopsAndPotentialCycles, 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;@1c01c63a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:13:25,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:13:25,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:13:25,351 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 03:13:25,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:13:25,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:25,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 03:13:25,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:25,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash 747623076, now seen corresponding path program 1 times [2023-08-04 03:13:25,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:25,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098502361] [2023-08-04 03:13:25,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:13:25,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:25,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098502361] [2023-08-04 03:13:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098502361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:25,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:13:25,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:13:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767595628] [2023-08-04 03:13:25,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:25,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:13:25,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:13:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:13:25,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-04 03:13:25,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:25,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:25,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-04 03:13:25,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:26,093 INFO L124 PetriNetUnfolderBase]: 8526/11037 cut-off events. [2023-08-04 03:13:26,093 INFO L125 PetriNetUnfolderBase]: For 1048/1048 co-relation queries the response was YES. [2023-08-04 03:13:26,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22380 conditions, 11037 events. 8526/11037 cut-off events. For 1048/1048 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 47561 event pairs, 3472 based on Foata normal form. 0/6248 useless extension candidates. Maximal degree in co-relation 6836. Up to 10600 conditions per place. [2023-08-04 03:13:26,165 INFO L140 encePairwiseOnDemand]: 226/230 looper letters, 35 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-04 03:13:26,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 216 flow [2023-08-04 03:13:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:13:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:13:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-04 03:13:26,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826086956521739 [2023-08-04 03:13:26,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-04 03:13:26,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-04 03:13:26,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:26,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-04 03:13:26,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:26,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:26,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:26,170 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 3 states and 333 transitions. [2023-08-04 03:13:26,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 216 flow [2023-08-04 03:13:26,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:13:26,173 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 134 flow [2023-08-04 03:13:26,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2023-08-04 03:13:26,174 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 03:13:26,174 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 134 flow [2023-08-04 03:13:26,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:26,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:26,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:26,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 03:13:26,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:26,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash -478754609, now seen corresponding path program 1 times [2023-08-04 03:13:26,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:26,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956938809] [2023-08-04 03:13:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:13:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956938809] [2023-08-04 03:13:26,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956938809] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479093937] [2023-08-04 03:13:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:26,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:26,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:26,224 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) [2023-08-04 03:13:26,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 03:13:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:26,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:13:26,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:13:26,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:13:26,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479093937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:26,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:13:26,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:13:26,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039740805] [2023-08-04 03:13:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:26,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:13:26,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:26,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:13:26,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:13:26,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-04 03:13:26,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:26,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:26,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-04 03:13:26,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:27,185 INFO L124 PetriNetUnfolderBase]: 8488/11014 cut-off events. [2023-08-04 03:13:27,185 INFO L125 PetriNetUnfolderBase]: For 859/859 co-relation queries the response was YES. [2023-08-04 03:13:27,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22260 conditions, 11014 events. 8488/11014 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 49290 event pairs, 3438 based on Foata normal form. 0/6262 useless extension candidates. Maximal degree in co-relation 22230. Up to 10389 conditions per place. [2023-08-04 03:13:27,236 INFO L140 encePairwiseOnDemand]: 227/230 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-04 03:13:27,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 234 flow [2023-08-04 03:13:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:13:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:13:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-04 03:13:27,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48695652173913045 [2023-08-04 03:13:27,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-04 03:13:27,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-04 03:13:27,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:27,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-04 03:13:27,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:27,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:27,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:27,241 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 134 flow. Second operand 3 states and 336 transitions. [2023-08-04 03:13:27,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 234 flow [2023-08-04 03:13:27,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 03:13:27,246 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 138 flow [2023-08-04 03:13:27,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2023-08-04 03:13:27,248 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-04 03:13:27,248 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 138 flow [2023-08-04 03:13:27,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:27,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:27,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:27,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:27,453 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 [2023-08-04 03:13:27,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:27,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash -124792310, now seen corresponding path program 1 times [2023-08-04 03:13:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:27,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567455667] [2023-08-04 03:13:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:13:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567455667] [2023-08-04 03:13:27,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567455667] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:27,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419104485] [2023-08-04 03:13:27,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:27,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:27,549 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) [2023-08-04 03:13:27,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 03:13:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:27,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:13:27,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:13:27,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:13:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419104485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:27,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:13:27,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:13:27,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612630524] [2023-08-04 03:13:27,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:27,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:13:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:27,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:13:27,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:13:27,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-04 03:13:27,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:27,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:27,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-04 03:13:27,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:28,194 INFO L124 PetriNetUnfolderBase]: 7283/9572 cut-off events. [2023-08-04 03:13:28,194 INFO L125 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2023-08-04 03:13:28,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19645 conditions, 9572 events. 7283/9572 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 43071 event pairs, 2490 based on Foata normal form. 0/5673 useless extension candidates. Maximal degree in co-relation 6727. Up to 6828 conditions per place. [2023-08-04 03:13:28,243 INFO L140 encePairwiseOnDemand]: 227/230 looper letters, 47 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 03:13:28,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 274 flow [2023-08-04 03:13:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:13:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:13:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-04 03:13:28,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2023-08-04 03:13:28,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-04 03:13:28,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-04 03:13:28,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:28,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-04 03:13:28,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:28,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:28,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:28,247 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 138 flow. Second operand 3 states and 342 transitions. [2023-08-04 03:13:28,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 274 flow [2023-08-04 03:13:28,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:13:28,250 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 148 flow [2023-08-04 03:13:28,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-04 03:13:28,250 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 03:13:28,250 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 148 flow [2023-08-04 03:13:28,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:28,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:28,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:28,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:28,459 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 [2023-08-04 03:13:28,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:28,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:28,460 INFO L85 PathProgramCache]: Analyzing trace with hash 381182609, now seen corresponding path program 1 times [2023-08-04 03:13:28,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:28,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130865468] [2023-08-04 03:13:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:13:28,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130865468] [2023-08-04 03:13:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130865468] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266724453] [2023-08-04 03:13:28,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:28,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:28,527 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) [2023-08-04 03:13:28,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 03:13:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:28,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:13:28,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:13:28,595 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:13:28,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266724453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:28,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:13:28,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 03:13:28,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216124849] [2023-08-04 03:13:28,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:28,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:13:28,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:28,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:13:28,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:13:28,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-04 03:13:28,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:28,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:28,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-04 03:13:28,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:29,341 INFO L124 PetriNetUnfolderBase]: 7160/9501 cut-off events. [2023-08-04 03:13:29,341 INFO L125 PetriNetUnfolderBase]: For 1501/1501 co-relation queries the response was YES. [2023-08-04 03:13:29,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20205 conditions, 9501 events. 7160/9501 cut-off events. For 1501/1501 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 42936 event pairs, 2789 based on Foata normal form. 0/5933 useless extension candidates. Maximal degree in co-relation 7255. Up to 7262 conditions per place. [2023-08-04 03:13:29,377 INFO L140 encePairwiseOnDemand]: 227/230 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-04 03:13:29,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 286 flow [2023-08-04 03:13:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:13:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:13:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-04 03:13:29,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2023-08-04 03:13:29,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-04 03:13:29,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-04 03:13:29,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:29,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-04 03:13:29,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:29,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:29,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:29,382 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 148 flow. Second operand 3 states and 342 transitions. [2023-08-04 03:13:29,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 286 flow [2023-08-04 03:13:29,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:13:29,388 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 158 flow [2023-08-04 03:13:29,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-04 03:13:29,389 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-04 03:13:29,389 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 158 flow [2023-08-04 03:13:29,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:29,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:29,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:29,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:29,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:29,594 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:29,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2040840783, now seen corresponding path program 1 times [2023-08-04 03:13:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:29,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806019153] [2023-08-04 03:13:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:13:29,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:29,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806019153] [2023-08-04 03:13:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806019153] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111106997] [2023-08-04 03:13:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:29,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:29,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:29,633 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) [2023-08-04 03:13:29,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 03:13:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:29,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:13:29,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:13:29,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:13:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:13:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111106997] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:13:29,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:13:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:13:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587430555] [2023-08-04 03:13:29,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:13:29,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:13:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:13:29,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:13:29,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-08-04 03:13:29,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:29,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:29,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-08-04 03:13:29,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:30,190 INFO L124 PetriNetUnfolderBase]: 6453/8554 cut-off events. [2023-08-04 03:13:30,191 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2023-08-04 03:13:30,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18389 conditions, 8554 events. 6453/8554 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 38322 event pairs, 1919 based on Foata normal form. 3/5405 useless extension candidates. Maximal degree in co-relation 12362. Up to 8125 conditions per place. [2023-08-04 03:13:30,239 INFO L140 encePairwiseOnDemand]: 226/230 looper letters, 41 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-08-04 03:13:30,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 264 flow [2023-08-04 03:13:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:13:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:13:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 431 transitions. [2023-08-04 03:13:30,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46847826086956523 [2023-08-04 03:13:30,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 431 transitions. [2023-08-04 03:13:30,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 431 transitions. [2023-08-04 03:13:30,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:30,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 431 transitions. [2023-08-04 03:13:30,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:30,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:30,245 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:30,245 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 158 flow. Second operand 4 states and 431 transitions. [2023-08-04 03:13:30,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 264 flow [2023-08-04 03:13:30,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:13:30,274 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 170 flow [2023-08-04 03:13:30,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-04 03:13:30,275 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-04 03:13:30,275 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 170 flow [2023-08-04 03:13:30,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:30,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:30,276 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:30,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:30,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:30,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:30,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1857599253, now seen corresponding path program 1 times [2023-08-04 03:13:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956292312] [2023-08-04 03:13:30,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:13:30,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:30,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956292312] [2023-08-04 03:13:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956292312] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:30,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315016397] [2023-08-04 03:13:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:30,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:30,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:30,524 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) [2023-08-04 03:13:30,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 03:13:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:30,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:13:30,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:13:30,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:13:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:13:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315016397] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:13:30,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:13:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 03:13:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734267450] [2023-08-04 03:13:30,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:13:30,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:13:30,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:30,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:13:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:13:30,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-08-04 03:13:30,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:30,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:30,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-08-04 03:13:30,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:31,024 INFO L124 PetriNetUnfolderBase]: 6114/8098 cut-off events. [2023-08-04 03:13:31,024 INFO L125 PetriNetUnfolderBase]: For 795/795 co-relation queries the response was YES. [2023-08-04 03:13:31,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17359 conditions, 8098 events. 6114/8098 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 36726 event pairs, 1699 based on Foata normal form. 27/5129 useless extension candidates. Maximal degree in co-relation 11398. Up to 6552 conditions per place. [2023-08-04 03:13:31,066 INFO L140 encePairwiseOnDemand]: 226/230 looper letters, 49 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 03:13:31,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 308 flow [2023-08-04 03:13:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:13:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:13:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-08-04 03:13:31,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4771739130434783 [2023-08-04 03:13:31,068 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-08-04 03:13:31,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-08-04 03:13:31,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:31,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-08-04 03:13:31,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:31,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:31,071 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:31,071 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 170 flow. Second operand 4 states and 439 transitions. [2023-08-04 03:13:31,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 308 flow [2023-08-04 03:13:31,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 299 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:13:31,086 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 175 flow [2023-08-04 03:13:31,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-08-04 03:13:31,086 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-04 03:13:31,086 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 175 flow [2023-08-04 03:13:31,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:31,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:31,087 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:31,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:31,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 03:13:31,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:31,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1401618501, now seen corresponding path program 1 times [2023-08-04 03:13:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039688514] [2023-08-04 03:13:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:13:31,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:31,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039688514] [2023-08-04 03:13:31,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039688514] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:31,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700404714] [2023-08-04 03:13:31,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:31,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:31,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:31,347 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:13:31,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 03:13:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:31,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:13:31,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:13:31,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:13:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:13:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700404714] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:13:31,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:13:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 03:13:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594299903] [2023-08-04 03:13:31,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:13:31,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:13:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:31,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:13:31,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:13:31,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-08-04 03:13:31,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:31,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:31,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-08-04 03:13:31,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:31,833 INFO L124 PetriNetUnfolderBase]: 4136/5529 cut-off events. [2023-08-04 03:13:31,833 INFO L125 PetriNetUnfolderBase]: For 1273/1273 co-relation queries the response was YES. [2023-08-04 03:13:31,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11980 conditions, 5529 events. 4136/5529 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22859 event pairs, 747 based on Foata normal form. 108/3585 useless extension candidates. Maximal degree in co-relation 10556. Up to 2080 conditions per place. [2023-08-04 03:13:31,855 INFO L140 encePairwiseOnDemand]: 226/230 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-04 03:13:31,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 346 flow [2023-08-04 03:13:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:13:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:13:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2023-08-04 03:13:31,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483695652173913 [2023-08-04 03:13:31,857 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 445 transitions. [2023-08-04 03:13:31,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions. [2023-08-04 03:13:31,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:31,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions. [2023-08-04 03:13:31,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:31,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:31,860 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:31,861 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 175 flow. Second operand 4 states and 445 transitions. [2023-08-04 03:13:31,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 346 flow [2023-08-04 03:13:31,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 336 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:13:31,868 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 186 flow [2023-08-04 03:13:31,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-04 03:13:31,869 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-04 03:13:31,869 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 186 flow [2023-08-04 03:13:31,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:31,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:31,870 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:31,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:32,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:32,076 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:32,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:32,076 INFO L85 PathProgramCache]: Analyzing trace with hash -336188778, now seen corresponding path program 1 times [2023-08-04 03:13:32,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:32,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637611474] [2023-08-04 03:13:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:32,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:13:32,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:32,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637611474] [2023-08-04 03:13:32,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637611474] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:32,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798956558] [2023-08-04 03:13:32,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:32,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:32,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:32,125 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:13:32,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 03:13:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:32,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:13:32,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:13:32,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:13:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:13:32,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798956558] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:13:32,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:13:32,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:13:32,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233811206] [2023-08-04 03:13:32,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:13:32,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:13:32,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:32,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:13:32,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:13:32,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-08-04 03:13:32,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:32,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:32,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-08-04 03:13:32,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:32,565 INFO L124 PetriNetUnfolderBase]: 4120/5502 cut-off events. [2023-08-04 03:13:32,565 INFO L125 PetriNetUnfolderBase]: For 2154/2154 co-relation queries the response was YES. [2023-08-04 03:13:32,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12516 conditions, 5502 events. 4120/5502 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22694 event pairs, 1861 based on Foata normal form. 13/3471 useless extension candidates. Maximal degree in co-relation 11102. Up to 4661 conditions per place. [2023-08-04 03:13:32,596 INFO L140 encePairwiseOnDemand]: 226/230 looper letters, 55 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2023-08-04 03:13:32,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 358 flow [2023-08-04 03:13:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:13:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:13:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2023-08-04 03:13:32,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483695652173913 [2023-08-04 03:13:32,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 445 transitions. [2023-08-04 03:13:32,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions. [2023-08-04 03:13:32,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:32,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions. [2023-08-04 03:13:32,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:32,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:32,601 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:32,601 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 186 flow. Second operand 4 states and 445 transitions. [2023-08-04 03:13:32,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 358 flow [2023-08-04 03:13:32,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 354 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:13:32,614 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 190 flow [2023-08-04 03:13:32,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-04 03:13:32,614 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 03:13:32,614 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 190 flow [2023-08-04 03:13:32,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:32,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:32,615 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:32,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:32,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 03:13:32,821 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:32,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 860369015, now seen corresponding path program 1 times [2023-08-04 03:13:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:32,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693620147] [2023-08-04 03:13:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:13:32,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:32,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693620147] [2023-08-04 03:13:32,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693620147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:32,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:13:32,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 03:13:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205801376] [2023-08-04 03:13:32,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:32,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 03:13:32,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:32,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 03:13:32,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 03:13:32,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-08-04 03:13:32,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:32,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:32,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-08-04 03:13:32,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:33,325 INFO L124 PetriNetUnfolderBase]: 4648/6201 cut-off events. [2023-08-04 03:13:33,325 INFO L125 PetriNetUnfolderBase]: For 2316/2316 co-relation queries the response was YES. [2023-08-04 03:13:33,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14123 conditions, 6201 events. 4648/6201 cut-off events. For 2316/2316 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 26235 event pairs, 1287 based on Foata normal form. 0/4133 useless extension candidates. Maximal degree in co-relation 13934. Up to 4615 conditions per place. [2023-08-04 03:13:33,347 INFO L140 encePairwiseOnDemand]: 226/230 looper letters, 65 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-04 03:13:33,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 464 flow [2023-08-04 03:13:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:13:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:13:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-08-04 03:13:33,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2023-08-04 03:13:33,348 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-08-04 03:13:33,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-08-04 03:13:33,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:33,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-08-04 03:13:33,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:33,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:33,351 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:33,351 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 190 flow. Second operand 4 states and 450 transitions. [2023-08-04 03:13:33,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 464 flow [2023-08-04 03:13:33,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 451 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:13:33,373 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 196 flow [2023-08-04 03:13:33,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-04 03:13:33,373 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-08-04 03:13:33,373 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 196 flow [2023-08-04 03:13:33,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:33,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:33,374 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:33,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 03:13:33,374 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:33,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash -886089370, now seen corresponding path program 1 times [2023-08-04 03:13:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:33,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898113766] [2023-08-04 03:13:33,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:33,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:13:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898113766] [2023-08-04 03:13:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898113766] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:33,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:13:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 03:13:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484287602] [2023-08-04 03:13:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:33,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:13:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:13:33,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:13:33,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 230 [2023-08-04 03:13:33,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:33,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:33,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 230 [2023-08-04 03:13:33,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:34,206 INFO L124 PetriNetUnfolderBase]: 8473/11407 cut-off events. [2023-08-04 03:13:34,206 INFO L125 PetriNetUnfolderBase]: For 6665/6665 co-relation queries the response was YES. [2023-08-04 03:13:34,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28780 conditions, 11407 events. 8473/11407 cut-off events. For 6665/6665 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 55794 event pairs, 2427 based on Foata normal form. 125/8001 useless extension candidates. Maximal degree in co-relation 28397. Up to 5612 conditions per place. [2023-08-04 03:13:34,255 INFO L140 encePairwiseOnDemand]: 225/230 looper letters, 95 selfloop transitions, 5 changer transitions 25/131 dead transitions. [2023-08-04 03:13:34,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 131 transitions, 834 flow [2023-08-04 03:13:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:13:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:13:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2023-08-04 03:13:34,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026086956521739 [2023-08-04 03:13:34,257 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2023-08-04 03:13:34,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2023-08-04 03:13:34,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:34,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2023-08-04 03:13:34,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:34,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:34,260 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:34,260 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 196 flow. Second operand 5 states and 578 transitions. [2023-08-04 03:13:34,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 131 transitions, 834 flow [2023-08-04 03:13:34,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 821 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-04 03:13:34,290 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 227 flow [2023-08-04 03:13:34,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-08-04 03:13:34,291 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-04 03:13:34,291 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 227 flow [2023-08-04 03:13:34,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:34,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:34,292 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:34,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 03:13:34,292 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:34,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1438864066, now seen corresponding path program 2 times [2023-08-04 03:13:34,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:34,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171961729] [2023-08-04 03:13:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 03:13:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171961729] [2023-08-04 03:13:34,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171961729] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:34,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747033498] [2023-08-04 03:13:34,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:13:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:34,356 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:13:34,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 03:13:34,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:13:34,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:13:34,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-04 03:13:34,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:13:34,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:13:34,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747033498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:13:34,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:13:34,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-08-04 03:13:34,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717870445] [2023-08-04 03:13:34,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:13:34,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 03:13:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:34,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 03:13:34,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-04 03:13:34,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-04 03:13:34,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:34,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:34,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-04 03:13:34,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:35,139 INFO L124 PetriNetUnfolderBase]: 8419/11393 cut-off events. [2023-08-04 03:13:35,139 INFO L125 PetriNetUnfolderBase]: For 9995/11700 co-relation queries the response was YES. [2023-08-04 03:13:35,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31935 conditions, 11393 events. 8419/11393 cut-off events. For 9995/11700 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 55899 event pairs, 3858 based on Foata normal form. 949/10028 useless extension candidates. Maximal degree in co-relation 31533. Up to 8592 conditions per place. [2023-08-04 03:13:35,196 INFO L140 encePairwiseOnDemand]: 226/230 looper letters, 67 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-04 03:13:35,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 496 flow [2023-08-04 03:13:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:13:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:13:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-08-04 03:13:35,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880434782608696 [2023-08-04 03:13:35,197 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-08-04 03:13:35,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-08-04 03:13:35,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:35,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-08-04 03:13:35,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:35,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:35,201 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:35,201 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 227 flow. Second operand 4 states and 449 transitions. [2023-08-04 03:13:35,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 496 flow [2023-08-04 03:13:35,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 492 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 03:13:35,239 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 239 flow [2023-08-04 03:13:35,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-08-04 03:13:35,240 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-04 03:13:35,240 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 239 flow [2023-08-04 03:13:35,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:35,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:35,240 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:35,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:35,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 03:13:35,446 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:35,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:35,446 INFO L85 PathProgramCache]: Analyzing trace with hash 977189586, now seen corresponding path program 1 times [2023-08-04 03:13:35,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:35,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252139582] [2023-08-04 03:13:35,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:35,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:13:35,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252139582] [2023-08-04 03:13:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252139582] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287470283] [2023-08-04 03:13:35,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:35,540 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:13:35,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 03:13:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:35,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 03:13:35,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:13:35,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:13:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:13:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287470283] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:13:35,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:13:35,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 03:13:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003372492] [2023-08-04 03:13:35,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:13:35,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 03:13:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 03:13:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 03:13:35,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 230 [2023-08-04 03:13:35,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 239 flow. Second operand has 8 states, 8 states have (on average 96.5) internal successors, (772), 8 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:35,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:35,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 230 [2023-08-04 03:13:35,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:36,335 INFO L124 PetriNetUnfolderBase]: 5537/7411 cut-off events. [2023-08-04 03:13:36,336 INFO L125 PetriNetUnfolderBase]: For 7307/7722 co-relation queries the response was YES. [2023-08-04 03:13:36,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22602 conditions, 7411 events. 5537/7411 cut-off events. For 7307/7722 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 33162 event pairs, 491 based on Foata normal form. 753/6662 useless extension candidates. Maximal degree in co-relation 22380. Up to 3417 conditions per place. [2023-08-04 03:13:36,381 INFO L140 encePairwiseOnDemand]: 224/230 looper letters, 164 selfloop transitions, 13 changer transitions 0/183 dead transitions. [2023-08-04 03:13:36,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 183 transitions, 1240 flow [2023-08-04 03:13:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 03:13:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 03:13:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 892 transitions. [2023-08-04 03:13:36,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48478260869565215 [2023-08-04 03:13:36,384 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 892 transitions. [2023-08-04 03:13:36,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 892 transitions. [2023-08-04 03:13:36,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:36,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 892 transitions. [2023-08-04 03:13:36,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:36,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 230.0) internal successors, (2070), 9 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:36,390 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 230.0) internal successors, (2070), 9 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:36,390 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 239 flow. Second operand 8 states and 892 transitions. [2023-08-04 03:13:36,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 183 transitions, 1240 flow [2023-08-04 03:13:36,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 183 transitions, 1211 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-04 03:13:36,411 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 294 flow [2023-08-04 03:13:36,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=294, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-04 03:13:36,411 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-08-04 03:13:36,412 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 294 flow [2023-08-04 03:13:36,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.5) internal successors, (772), 8 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:36,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:36,412 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:36,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:36,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-04 03:13:36,618 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:36,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash -810127287, now seen corresponding path program 1 times [2023-08-04 03:13:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:36,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451345505] [2023-08-04 03:13:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:36,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:13:36,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451345505] [2023-08-04 03:13:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451345505] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477155710] [2023-08-04 03:13:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:36,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:36,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:36,720 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:13:36,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 03:13:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:36,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 03:13:36,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:13:36,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:13:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:13:36,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477155710] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:13:36,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:13:36,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 7 [2023-08-04 03:13:36,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372547159] [2023-08-04 03:13:36,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:13:36,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:13:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:13:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:13:36,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 230 [2023-08-04 03:13:36,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 294 flow. Second operand has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:36,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:36,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 230 [2023-08-04 03:13:36,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:37,689 INFO L124 PetriNetUnfolderBase]: 7488/10272 cut-off events. [2023-08-04 03:13:37,689 INFO L125 PetriNetUnfolderBase]: For 16509/17806 co-relation queries the response was YES. [2023-08-04 03:13:37,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33209 conditions, 10272 events. 7488/10272 cut-off events. For 16509/17806 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 47600 event pairs, 1559 based on Foata normal form. 665/9449 useless extension candidates. Maximal degree in co-relation 32949. Up to 5521 conditions per place. [2023-08-04 03:13:37,737 INFO L140 encePairwiseOnDemand]: 221/230 looper letters, 130 selfloop transitions, 39 changer transitions 0/178 dead transitions. [2023-08-04 03:13:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 178 transitions, 1271 flow [2023-08-04 03:13:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-04 03:13:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-04 03:13:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1078 transitions. [2023-08-04 03:13:37,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46869565217391307 [2023-08-04 03:13:37,740 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1078 transitions. [2023-08-04 03:13:37,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1078 transitions. [2023-08-04 03:13:37,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:37,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1078 transitions. [2023-08-04 03:13:37,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.8) internal successors, (1078), 10 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:37,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 230.0) internal successors, (2530), 11 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:37,746 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 230.0) internal successors, (2530), 11 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:37,746 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 294 flow. Second operand 10 states and 1078 transitions. [2023-08-04 03:13:37,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 178 transitions, 1271 flow [2023-08-04 03:13:37,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 178 transitions, 1230 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:13:37,778 INFO L231 Difference]: Finished difference. Result has 86 places, 87 transitions, 605 flow [2023-08-04 03:13:37,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=605, PETRI_PLACES=86, PETRI_TRANSITIONS=87} [2023-08-04 03:13:37,779 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2023-08-04 03:13:37,779 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 87 transitions, 605 flow [2023-08-04 03:13:37,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:37,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:37,779 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:37,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:37,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 03:13:37,988 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:37,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1689211429, now seen corresponding path program 1 times [2023-08-04 03:13:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:37,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616572409] [2023-08-04 03:13:37,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:13:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616572409] [2023-08-04 03:13:38,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616572409] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678503583] [2023-08-04 03:13:38,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:38,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:38,273 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:13:38,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 03:13:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:38,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-04 03:13:38,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:13:38,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:13:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:13:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678503583] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:13:38,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:13:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 5] total 12 [2023-08-04 03:13:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856561822] [2023-08-04 03:13:38,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:13:38,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 03:13:38,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:38,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 03:13:38,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:13:38,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 230 [2023-08-04 03:13:38,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 87 transitions, 605 flow. Second operand has 14 states, 14 states have (on average 99.85714285714286) internal successors, (1398), 14 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:38,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:38,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 230 [2023-08-04 03:13:38,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:44,189 INFO L124 PetriNetUnfolderBase]: 38297/52325 cut-off events. [2023-08-04 03:13:44,189 INFO L125 PetriNetUnfolderBase]: For 181994/188769 co-relation queries the response was YES. [2023-08-04 03:13:44,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216689 conditions, 52325 events. 38297/52325 cut-off events. For 181994/188769 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 309153 event pairs, 3455 based on Foata normal form. 6776/55596 useless extension candidates. Maximal degree in co-relation 215569. Up to 13072 conditions per place. [2023-08-04 03:13:44,586 INFO L140 encePairwiseOnDemand]: 222/230 looper letters, 315 selfloop transitions, 107 changer transitions 9/442 dead transitions. [2023-08-04 03:13:44,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 442 transitions, 3513 flow [2023-08-04 03:13:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:13:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:13:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1436 transitions. [2023-08-04 03:13:44,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202898550724637 [2023-08-04 03:13:44,590 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1436 transitions. [2023-08-04 03:13:44,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1436 transitions. [2023-08-04 03:13:44,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:44,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1436 transitions. [2023-08-04 03:13:44,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 119.66666666666667) internal successors, (1436), 12 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:44,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:44,598 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:44,598 INFO L175 Difference]: Start difference. First operand has 86 places, 87 transitions, 605 flow. Second operand 12 states and 1436 transitions. [2023-08-04 03:13:44,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 442 transitions, 3513 flow [2023-08-04 03:13:45,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 442 transitions, 3458 flow, removed 27 selfloop flow, removed 1 redundant places. [2023-08-04 03:13:45,132 INFO L231 Difference]: Finished difference. Result has 99 places, 180 transitions, 1463 flow [2023-08-04 03:13:45,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1463, PETRI_PLACES=99, PETRI_TRANSITIONS=180} [2023-08-04 03:13:45,133 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2023-08-04 03:13:45,133 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 180 transitions, 1463 flow [2023-08-04 03:13:45,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 99.85714285714286) internal successors, (1398), 14 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:45,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:45,133 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:45,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:45,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:45,334 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:45,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1401230515, now seen corresponding path program 2 times [2023-08-04 03:13:45,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:45,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872153143] [2023-08-04 03:13:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 03:13:45,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:45,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872153143] [2023-08-04 03:13:45,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872153143] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:45,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596607366] [2023-08-04 03:13:45,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:13:45,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:45,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:45,540 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:13:45,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 03:13:45,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:13:45,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:13:45,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-04 03:13:45,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:13:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 03:13:45,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:13:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 03:13:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596607366] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:13:45,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:13:45,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2023-08-04 03:13:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692194614] [2023-08-04 03:13:45,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:13:45,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-04 03:13:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:13:45,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-04 03:13:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-08-04 03:13:46,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 230 [2023-08-04 03:13:46,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 180 transitions, 1463 flow. Second operand has 15 states, 15 states have (on average 97.86666666666666) internal successors, (1468), 15 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:46,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:13:46,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 230 [2023-08-04 03:13:46,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:13:56,789 INFO L124 PetriNetUnfolderBase]: 72308/98958 cut-off events. [2023-08-04 03:13:56,789 INFO L125 PetriNetUnfolderBase]: For 493788/504166 co-relation queries the response was YES. [2023-08-04 03:13:57,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465878 conditions, 98958 events. 72308/98958 cut-off events. For 493788/504166 co-relation queries the response was YES. Maximal size of possible extension queue 2469. Compared 630689 event pairs, 11692 based on Foata normal form. 14738/113409 useless extension candidates. Maximal degree in co-relation 464610. Up to 55113 conditions per place. [2023-08-04 03:13:57,839 INFO L140 encePairwiseOnDemand]: 222/230 looper letters, 439 selfloop transitions, 147 changer transitions 17/618 dead transitions. [2023-08-04 03:13:57,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 618 transitions, 5811 flow [2023-08-04 03:13:57,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 03:13:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 03:13:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1499 transitions. [2023-08-04 03:13:57,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013377926421405 [2023-08-04 03:13:57,843 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1499 transitions. [2023-08-04 03:13:57,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1499 transitions. [2023-08-04 03:13:57,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:13:57,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1499 transitions. [2023-08-04 03:13:57,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.3076923076923) internal successors, (1499), 13 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:57,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:57,851 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:57,851 INFO L175 Difference]: Start difference. First operand has 99 places, 180 transitions, 1463 flow. Second operand 13 states and 1499 transitions. [2023-08-04 03:13:57,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 618 transitions, 5811 flow [2023-08-04 03:13:59,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 618 transitions, 5787 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-04 03:13:59,543 INFO L231 Difference]: Finished difference. Result has 122 places, 291 transitions, 3111 flow [2023-08-04 03:13:59,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3111, PETRI_PLACES=122, PETRI_TRANSITIONS=291} [2023-08-04 03:13:59,543 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2023-08-04 03:13:59,544 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 291 transitions, 3111 flow [2023-08-04 03:13:59,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 97.86666666666666) internal successors, (1468), 15 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:13:59,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:13:59,544 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:13:59,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-04 03:13:59,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:59,745 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:13:59,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:13:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash -320946811, now seen corresponding path program 3 times [2023-08-04 03:13:59,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:13:59,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951029407] [2023-08-04 03:13:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:13:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:13:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:13:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:13:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:13:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951029407] [2023-08-04 03:13:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951029407] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:13:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42462027] [2023-08-04 03:13:59,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:13:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:13:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:13:59,994 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:14:00,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-04 03:14:00,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-04 03:14:00,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:14:00,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-04 03:14:00,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:14:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:14:00,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:14:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:14:00,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42462027] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:14:00,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:14:00,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2023-08-04 03:14:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201464661] [2023-08-04 03:14:00,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:14:00,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-04 03:14:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:14:00,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-04 03:14:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-08-04 03:14:00,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 230 [2023-08-04 03:14:00,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 291 transitions, 3111 flow. Second operand has 16 states, 16 states have (on average 97.6875) internal successors, (1563), 16 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:14:00,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:14:00,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 230 [2023-08-04 03:14:00,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:14:02,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][336], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1870#(= ~counter~0 1), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 47#L41-4true, Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 46#L54-1true, Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 2439#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), 11#L72-11true, Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:02,448 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-04 03:14:02,448 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:14:02,448 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:14:02,448 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:14:03,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][335], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 47#L41-4true, Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 46#L54-1true, 2748#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0) (<= (+ thread2Thread1of2ForFork1_~i~1 1) ~M~0)), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 11#L72-11true, Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:03,143 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,143 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,143 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,143 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][336], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 47#L41-4true, Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), 51#thread2EXITtrue, Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 2439#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), 11#L72-11true, Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:03,143 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,143 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,143 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,144 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][336], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), 47#L41-4true, Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 46#L54-1true, Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 589#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 2439#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 8#L73-8true, 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:03,147 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,147 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,147 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:14:03,147 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:14:04,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][335], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), 47#L41-4true, Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 46#L54-1true, 2748#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0) (<= (+ thread2Thread1of2ForFork1_~i~1 1) ~M~0)), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 589#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 8#L73-8true, 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:04,071 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,071 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,071 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,071 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][336], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 47#L41-4true, Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), 51#thread2EXITtrue, Black: 587#true, Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 589#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 2439#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 8#L73-8true, 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:04,071 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,071 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,071 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,071 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][336], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), 1870#(= ~counter~0 1), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), 47#L41-4true, Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 106#L73-3true, Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 46#L54-1true, Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 589#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 2439#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:04,077 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,077 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,077 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 03:14:04,077 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 03:14:05,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][335], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), 47#L41-4true, Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 106#L73-3true, Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 2748#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0) (<= (+ thread2Thread1of2ForFork1_~i~1 1) ~M~0)), 46#L54-1true, Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 589#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:05,202 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 03:14:05,202 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 03:14:05,202 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 03:14:05,202 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 03:14:05,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][336], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 47#L41-4true, Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), 51#thread2EXITtrue, Black: 587#true, Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 106#L73-3true, Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 589#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 2439#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:05,203 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 03:14:05,203 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 03:14:05,203 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 03:14:05,203 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 03:14:06,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][336], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 47#L41-4true, Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 589#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 2439#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), 35#L73-4true, Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:06,454 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 03:14:06,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 03:14:06,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 03:14:06,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 03:14:09,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][336], [Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), 47#L41-4true, Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 2439#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 8#L73-8true, 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:09,780 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2023-08-04 03:14:09,780 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-08-04 03:14:09,780 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-08-04 03:14:09,780 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-08-04 03:14:10,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][336], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1870#(= ~counter~0 1), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 47#L41-4true, Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, 106#L73-3true, Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 2439#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:10,550 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 03:14:10,550 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 03:14:10,550 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 03:14:10,550 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 03:14:11,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][407], [Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 47#L41-4true, Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), 2435#true, Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 1877#(= ~counter~0 2), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 8#L73-8true, 1029#true, 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:11,065 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-08-04 03:14:11,065 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 03:14:11,065 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 03:14:11,065 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 03:14:12,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][407], [Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), 2435#true, Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 1877#(= ~counter~0 2), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 8#L73-8true, 1029#true, 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 29#thread1EXITtrue, 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:12,056 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-08-04 03:14:12,056 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 03:14:12,056 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 03:14:12,056 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 03:14:13,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][407], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), 2435#true, Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, 106#L73-3true, Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 1877#(= ~counter~0 2), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 29#thread1EXITtrue, 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:13,192 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-08-04 03:14:13,192 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 03:14:13,192 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 03:14:13,192 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 03:14:14,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][407], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), 2435#true, Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 587#true, 1877#(= ~counter~0 2), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0NotInUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), 35#L73-4true, Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:14,285 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-08-04 03:14:14,285 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 03:14:14,285 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 03:14:14,285 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 03:14:15,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][407], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), 2435#true, Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 1877#(= ~counter~0 2), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 8#L73-8true, 1029#true, 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0NotInUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:15,466 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 03:14:15,466 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 03:14:15,466 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 03:14:15,466 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 03:14:15,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][407], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 32#L74-8true, Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), 2435#true, Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 1877#(= ~counter~0 2), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0NotInUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 787#true, Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:15,911 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 03:14:15,911 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 03:14:15,911 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 03:14:15,911 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 03:14:16,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([743] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_156 1) v_~counter~0_155) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37) (< v_thread1Thread2of2ForFork0_~i~0_38 v_~M~0_138)) InVars {~counter~0=v_~counter~0_156, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138} OutVars{thread1Thread2of2ForFork0_#t~post2=|v_thread1Thread2of2ForFork0_#t~post2_15|, ~counter~0=v_~counter~0_155, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138} AuxVars[] AssignedVars[thread1Thread2of2ForFork0_#t~post2, ~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][407], [Black: 1785#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2117#(and (< 0 ~M~0) (= ~counter~0 0)), Black: 1782#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2418#(and (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 2410#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0)), Black: 1779#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1774#(and (<= ~counter~0 0) (<= 1 ~M~0)), Black: 1026#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 192#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1475#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 414#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1188#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 1 ~M~0)), Black: 1477#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), 109#L74-3true, 2435#true, Black: 1032#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 590#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 262#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 1877#(= ~counter~0 2), Black: 146#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 256#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1103#(and (<= thread2Thread1of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1029#true, 2113#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 1488#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), 53#L41-4true, 36#L54-1true, thread1Thread1of2ForFork0NotInUse, thread2Thread1of2ForFork1NotInUse, Black: 1801#(and (<= 2 ~counter~0) (<= ~counter~0 2) (<= 1 ~M~0)), Black: 2110#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 1800#(and (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2414#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 1798#(= ~counter~0 0), Black: 2324#(< thread2Thread2of2ForFork1_~i~1 ~M~0), 1471#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~M~0)), Black: 121#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 2416#(and (<= ~counter~0 1) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~counter~0) (<= 1 ~M~0)), Black: 2412#(and (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 0) (<= 1 ~M~0)), Black: 790#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1787#(and (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread2of2ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 2422#(and (= thread1Thread1of2ForFork0_~i~0 0) (< 0 ~M~0) (= ~counter~0 0) (< thread2Thread2of2ForFork1_~i~1 ~M~0)), Black: 787#true, Black: 1776#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= ~counter~0 0) (<= 1 ~M~0)), Black: 2420#(and (<= ~counter~0 1) (<= 1 ~counter~0) (< thread2Thread2of2ForFork1_~i~1 ~M~0) (<= 1 ~M~0))]) [2023-08-04 03:14:16,604 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 03:14:16,604 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 03:14:16,604 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 03:14:16,604 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 03:14:18,078 INFO L124 PetriNetUnfolderBase]: 96279/130973 cut-off events. [2023-08-04 03:14:18,078 INFO L125 PetriNetUnfolderBase]: For 1374839/1389164 co-relation queries the response was YES. [2023-08-04 03:14:18,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755881 conditions, 130973 events. 96279/130973 cut-off events. For 1374839/1389164 co-relation queries the response was YES. Maximal size of possible extension queue 3211. Compared 855939 event pairs, 13495 based on Foata normal form. 17149/147247 useless extension candidates. Maximal degree in co-relation 754534. Up to 67050 conditions per place. [2023-08-04 03:14:19,456 INFO L140 encePairwiseOnDemand]: 222/230 looper letters, 496 selfloop transitions, 255 changer transitions 17/785 dead transitions. [2023-08-04 03:14:19,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 785 transitions, 9100 flow [2023-08-04 03:14:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 03:14:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 03:14:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1515 transitions. [2023-08-04 03:14:19,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066889632107023 [2023-08-04 03:14:19,459 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1515 transitions. [2023-08-04 03:14:19,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1515 transitions. [2023-08-04 03:14:19,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:14:19,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1515 transitions. [2023-08-04 03:14:19,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.53846153846153) internal successors, (1515), 13 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:14:19,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:14:19,467 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:14:19,467 INFO L175 Difference]: Start difference. First operand has 122 places, 291 transitions, 3111 flow. Second operand 13 states and 1515 transitions. [2023-08-04 03:14:19,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 785 transitions, 9100 flow [2023-08-04 03:14:30,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 785 transitions, 8926 flow, removed 87 selfloop flow, removed 0 redundant places. [2023-08-04 03:14:30,563 INFO L231 Difference]: Finished difference. Result has 145 places, 425 transitions, 5653 flow [2023-08-04 03:14:30,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=3027, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5653, PETRI_PLACES=145, PETRI_TRANSITIONS=425} [2023-08-04 03:14:30,563 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 104 predicate places. [2023-08-04 03:14:30,563 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 425 transitions, 5653 flow [2023-08-04 03:14:30,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 97.6875) internal successors, (1563), 16 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:14:30,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:14:30,564 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:14:30,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-04 03:14:30,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:14:30,775 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:14:30,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:14:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1540906744, now seen corresponding path program 4 times [2023-08-04 03:14:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:14:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644921174] [2023-08-04 03:14:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:14:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:14:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:14:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 03:14:30,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:14:30,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644921174] [2023-08-04 03:14:30,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644921174] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:14:30,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607977890] [2023-08-04 03:14:30,909 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 03:14:30,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:14:30,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:14:30,914 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:14:30,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-04 03:14:30,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 03:14:30,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:14:30,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:14:31,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:14:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 03:14:31,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:14:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 03:14:31,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607977890] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:14:31,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:14:31,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-08-04 03:14:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909760445] [2023-08-04 03:14:31,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:14:31,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-04 03:14:31,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:14:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-04 03:14:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:14:31,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 230 [2023-08-04 03:14:31,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 425 transitions, 5653 flow. Second operand has 11 states, 11 states have (on average 95.9090909090909) internal successors, (1055), 11 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:14:31,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:14:31,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 230 [2023-08-04 03:14:31,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:15:05,912 INFO L124 PetriNetUnfolderBase]: 160638/219243 cut-off events. [2023-08-04 03:15:05,913 INFO L125 PetriNetUnfolderBase]: For 2980899/3003975 co-relation queries the response was YES. [2023-08-04 03:15:07,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380891 conditions, 219243 events. 160638/219243 cut-off events. For 2980899/3003975 co-relation queries the response was YES. Maximal size of possible extension queue 5391. Compared 1536238 event pairs, 31149 based on Foata normal form. 19168/236316 useless extension candidates. Maximal degree in co-relation 1372379. Up to 88917 conditions per place. [2023-08-04 03:15:08,825 INFO L140 encePairwiseOnDemand]: 225/230 looper letters, 1075 selfloop transitions, 148 changer transitions 0/1252 dead transitions. [2023-08-04 03:15:08,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 1252 transitions, 17533 flow [2023-08-04 03:15:08,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 03:15:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 03:15:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 817 transitions. [2023-08-04 03:15:08,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074534161490684 [2023-08-04 03:15:08,826 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 817 transitions. [2023-08-04 03:15:08,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 817 transitions. [2023-08-04 03:15:08,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:15:08,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 817 transitions. [2023-08-04 03:15:08,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:15:08,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:15:08,829 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:15:08,830 INFO L175 Difference]: Start difference. First operand has 145 places, 425 transitions, 5653 flow. Second operand 7 states and 817 transitions. [2023-08-04 03:15:08,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 1252 transitions, 17533 flow [2023-08-04 03:16:03,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 1252 transitions, 17099 flow, removed 217 selfloop flow, removed 0 redundant places. [2023-08-04 03:16:03,175 INFO L231 Difference]: Finished difference. Result has 155 places, 504 transitions, 7146 flow [2023-08-04 03:16:03,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5505, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7146, PETRI_PLACES=155, PETRI_TRANSITIONS=504} [2023-08-04 03:16:03,176 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 114 predicate places. [2023-08-04 03:16:03,176 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 504 transitions, 7146 flow [2023-08-04 03:16:03,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 95.9090909090909) internal successors, (1055), 11 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:16:03,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:16:03,176 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:16:03,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-04 03:16:03,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:16:03,377 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:16:03,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:16:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1211308998, now seen corresponding path program 5 times [2023-08-04 03:16:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:16:03,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142492155] [2023-08-04 03:16:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:16:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:16:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:16:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 03:16:03,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:16:03,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142492155] [2023-08-04 03:16:03,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142492155] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:16:03,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404308042] [2023-08-04 03:16:03,454 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-04 03:16:03,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:16:03,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:16:03,456 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:16:03,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-04 03:16:03,538 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:16:03,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:16:03,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:16:03,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:16:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 03:16:03,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:16:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 03:16:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404308042] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:16:03,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:16:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-08-04 03:16:03,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897733734] [2023-08-04 03:16:03,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:16:03,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-04 03:16:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:16:03,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-04 03:16:03,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:16:03,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 230 [2023-08-04 03:16:03,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 504 transitions, 7146 flow. Second operand has 11 states, 11 states have (on average 95.63636363636364) internal successors, (1052), 11 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:16:03,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:16:03,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 230 [2023-08-04 03:16:03,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:16:47,361 INFO L124 PetriNetUnfolderBase]: 168959/231552 cut-off events. [2023-08-04 03:16:47,361 INFO L125 PetriNetUnfolderBase]: For 3673920/3701231 co-relation queries the response was YES. [2023-08-04 03:16:49,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521820 conditions, 231552 events. 168959/231552 cut-off events. For 3673920/3701231 co-relation queries the response was YES. Maximal size of possible extension queue 5843. Compared 1651189 event pairs, 28415 based on Foata normal form. 20528/251198 useless extension candidates. Maximal degree in co-relation 1512226. Up to 92519 conditions per place. [2023-08-04 03:16:50,665 INFO L140 encePairwiseOnDemand]: 224/230 looper letters, 1476 selfloop transitions, 178 changer transitions 203/1886 dead transitions. [2023-08-04 03:16:50,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 1886 transitions, 27432 flow [2023-08-04 03:16:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 03:16:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 03:16:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1263 transitions. [2023-08-04 03:16:50,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4992094861660079 [2023-08-04 03:16:50,667 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1263 transitions. [2023-08-04 03:16:50,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1263 transitions. [2023-08-04 03:16:50,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:16:50,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1263 transitions. [2023-08-04 03:16:50,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.81818181818181) internal successors, (1263), 11 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:16:50,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:16:50,673 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:16:50,673 INFO L175 Difference]: Start difference. First operand has 155 places, 504 transitions, 7146 flow. Second operand 11 states and 1263 transitions. [2023-08-04 03:16:50,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 1886 transitions, 27432 flow [2023-08-04 03:17:52,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 1886 transitions, 27206 flow, removed 52 selfloop flow, removed 2 redundant places. [2023-08-04 03:17:52,861 INFO L231 Difference]: Finished difference. Result has 168 places, 586 transitions, 8999 flow [2023-08-04 03:17:52,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=6970, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8999, PETRI_PLACES=168, PETRI_TRANSITIONS=586} [2023-08-04 03:17:52,861 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2023-08-04 03:17:52,861 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 586 transitions, 8999 flow [2023-08-04 03:17:52,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 95.63636363636364) internal successors, (1052), 11 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:17:52,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:17:52,862 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:17:52,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-04 03:17:53,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:17:53,063 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:17:53,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:17:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1664313376, now seen corresponding path program 6 times [2023-08-04 03:17:53,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:17:53,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147273746] [2023-08-04 03:17:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:17:53,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:17:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:17:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:17:53,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:17:53,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147273746] [2023-08-04 03:17:53,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147273746] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:17:53,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000670181] [2023-08-04 03:17:53,181 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-04 03:17:53,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:17:53,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:17:53,182 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:17:53,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-04 03:17:53,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-04 03:17:53,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:17:53,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:17:53,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:17:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:17:53,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:17:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:17:53,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000670181] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:17:53,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:17:53,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-08-04 03:17:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480603359] [2023-08-04 03:17:53,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:17:53,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 03:17:53,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:17:53,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 03:17:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-08-04 03:17:53,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 230 [2023-08-04 03:17:53,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 586 transitions, 8999 flow. Second operand has 13 states, 13 states have (on average 96.84615384615384) internal successors, (1259), 13 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:17:53,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:17:53,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 230 [2023-08-04 03:17:53,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:19:16,177 INFO L124 PetriNetUnfolderBase]: 280554/381387 cut-off events. [2023-08-04 03:19:16,177 INFO L125 PetriNetUnfolderBase]: For 6112075/6151816 co-relation queries the response was YES. [2023-08-04 03:19:19,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2597137 conditions, 381387 events. 280554/381387 cut-off events. For 6112075/6151816 co-relation queries the response was YES. Maximal size of possible extension queue 9370. Compared 2795953 event pairs, 39636 based on Foata normal form. 43611/422359 useless extension candidates. Maximal degree in co-relation 2586487. Up to 190072 conditions per place. [2023-08-04 03:19:22,245 INFO L140 encePairwiseOnDemand]: 224/230 looper letters, 1642 selfloop transitions, 492 changer transitions 0/2163 dead transitions. [2023-08-04 03:19:22,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 2163 transitions, 32251 flow [2023-08-04 03:19:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 03:19:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 03:19:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1280 transitions. [2023-08-04 03:19:22,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059288537549407 [2023-08-04 03:19:22,247 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1280 transitions. [2023-08-04 03:19:22,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1280 transitions. [2023-08-04 03:19:22,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:19:22,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1280 transitions. [2023-08-04 03:19:22,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.36363636363636) internal successors, (1280), 11 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:19:22,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:19:22,251 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:19:22,251 INFO L175 Difference]: Start difference. First operand has 168 places, 586 transitions, 8999 flow. Second operand 11 states and 1280 transitions. [2023-08-04 03:19:22,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 2163 transitions, 32251 flow Received shutdown request... [2023-08-04 03:25:59,429 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 03:25:59,431 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 03:26:00,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2023-08-04 03:26:00,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown