/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:36:36,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:36:36,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:36:36,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:36:36,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:36:36,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:36:36,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:36:36,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:36:36,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:36:36,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:36:36,288 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:36:36,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:36:36,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:36:36,289 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:36:36,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:36:36,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:36:36,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:36:36,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:36:36,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:36:36,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:36:36,291 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:36:36,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:36:36,292 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:36:36,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:36:36,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:36:36,293 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:36:36,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:36:36,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:36:36,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:36:36,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:36:36,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:36:36,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:36:36,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:36:36,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:36:36,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:36:36,296 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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-24 05:36:36,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:36:36,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:36:36,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:36:36,632 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:36:36,632 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:36:36,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:36:37,911 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:36:38,196 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:36:38,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:36:38,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e10735f/74599e0bb08849ab8668a0ca22a6ba8a/FLAG852d3269e [2023-08-24 05:36:38,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e10735f/74599e0bb08849ab8668a0ca22a6ba8a [2023-08-24 05:36:38,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:36:38,230 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:36:38,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:36:38,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:36:38,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:36:38,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e72e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38, skipping insertion in model container [2023-08-24 05:36:38,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,295 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:36:38,455 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-24 05:36:38,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:36:38,654 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:36:38,663 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-24 05:36:38,671 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:36:38,673 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:36:38,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:36:38,758 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:36:38,758 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:36:38,764 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:36:38,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38 WrapperNode [2023-08-24 05:36:38,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:36:38,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:36:38,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:36:38,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:36:38,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,810 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-24 05:36:38,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:36:38,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:36:38,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:36:38,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:36:38,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:36:38,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:36:38,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:36:38,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:36:38,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (1/1) ... [2023-08-24 05:36:38,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:36:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:36:38,870 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-24 05:36:38,889 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-24 05:36:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:36:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:36:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:36:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:36:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:36:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:36:38,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:36:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:36:38,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:36:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:36:38,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:36:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:36:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:36:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:36:38,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:36:38,923 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:36:39,070 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:36:39,071 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:36:39,344 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:36:39,546 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:36:39,546 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:36:39,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:36:39 BoogieIcfgContainer [2023-08-24 05:36:39,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:36:39,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:36:39,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:36:39,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:36:39,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:36:38" (1/3) ... [2023-08-24 05:36:39,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@981f9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:36:39, skipping insertion in model container [2023-08-24 05:36:39,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:38" (2/3) ... [2023-08-24 05:36:39,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@981f9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:36:39, skipping insertion in model container [2023-08-24 05:36:39,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:36:39" (3/3) ... [2023-08-24 05:36:39,557 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:36:39,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:36:39,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:36:39,574 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:36:39,632 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:36:39,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2023-08-24 05:36:39,732 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-08-24 05:36:39,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:36:39,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-08-24 05:36:39,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2023-08-24 05:36:39,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2023-08-24 05:36:39,744 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:36:39,756 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2023-08-24 05:36:39,760 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2023-08-24 05:36:39,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2023-08-24 05:36:39,802 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-08-24 05:36:39,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:36:39,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-08-24 05:36:39,805 INFO L119 LiptonReduction]: Number of co-enabled transitions 2022 [2023-08-24 05:36:43,314 INFO L134 LiptonReduction]: Checked pairs total: 5460 [2023-08-24 05:36:43,314 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-24 05:36:43,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:36:43,330 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=false, 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;@25ece83d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:36:43,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:36:43,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:36:43,333 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-24 05:36:43,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:36:43,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:43,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:36:43,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:43,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 525870182, now seen corresponding path program 1 times [2023-08-24 05:36:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157932371] [2023-08-24 05:36:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:43,728 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-24 05:36:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:43,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157932371] [2023-08-24 05:36:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157932371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:36:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428389176] [2023-08-24 05:36:43,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:43,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:36:43,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:36:43,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:36:43,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 201 [2023-08-24 05:36:43,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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-24 05:36:43,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:43,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 201 [2023-08-24 05:36:43,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:44,220 INFO L124 PetriNetUnfolderBase]: 1683/2656 cut-off events. [2023-08-24 05:36:44,220 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-24 05:36:44,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5187 conditions, 2656 events. 1683/2656 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13854 event pairs, 285 based on Foata normal form. 0/2536 useless extension candidates. Maximal degree in co-relation 5176. Up to 1975 conditions per place. [2023-08-24 05:36:44,235 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 35 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-08-24 05:36:44,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 170 flow [2023-08-24 05:36:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:36:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:36:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-24 05:36:44,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527363184079602 [2023-08-24 05:36:44,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-24 05:36:44,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-24 05:36:44,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:44,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-24 05:36:44,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-24 05:36:44,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 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-24 05:36:44,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 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-24 05:36:44,258 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 318 transitions. [2023-08-24 05:36:44,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 170 flow [2023-08-24 05:36:44,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:36:44,261 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-08-24 05:36:44,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-08-24 05:36:44,266 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-08-24 05:36:44,266 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-08-24 05:36:44,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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-24 05:36:44,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:44,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:44,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:36:44,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:44,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash 648657845, now seen corresponding path program 1 times [2023-08-24 05:36:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:44,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235110788] [2023-08-24 05:36:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:44,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:45,273 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-24 05:36:45,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235110788] [2023-08-24 05:36:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235110788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:45,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:36:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890916769] [2023-08-24 05:36:45,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:45,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:36:45,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:45,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:36:45,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:36:45,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-08-24 05:36:45,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 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-24 05:36:45,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:45,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-08-24 05:36:45,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:45,645 INFO L124 PetriNetUnfolderBase]: 1317/1981 cut-off events. [2023-08-24 05:36:45,646 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-08-24 05:36:45,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4187 conditions, 1981 events. 1317/1981 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9246 event pairs, 458 based on Foata normal form. 120/2098 useless extension candidates. Maximal degree in co-relation 4177. Up to 1044 conditions per place. [2023-08-24 05:36:45,655 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 33 selfloop transitions, 2 changer transitions 20/56 dead transitions. [2023-08-24 05:36:45,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 242 flow [2023-08-24 05:36:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:36:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:36:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2023-08-24 05:36:45,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44975124378109455 [2023-08-24 05:36:45,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 452 transitions. [2023-08-24 05:36:45,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 452 transitions. [2023-08-24 05:36:45,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:45,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 452 transitions. [2023-08-24 05:36:45,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 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-24 05:36:45,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-24 05:36:45,665 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-24 05:36:45,665 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 5 states and 452 transitions. [2023-08-24 05:36:45,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 242 flow [2023-08-24 05:36:45,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:36:45,667 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 64 flow [2023-08-24 05:36:45,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-08-24 05:36:45,668 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-08-24 05:36:45,668 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 64 flow [2023-08-24 05:36:45,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 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-24 05:36:45,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:45,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:45,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:36:45,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:45,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1877775071, now seen corresponding path program 1 times [2023-08-24 05:36:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:45,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453793762] [2023-08-24 05:36:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:46,440 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-24 05:36:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453793762] [2023-08-24 05:36:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453793762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:46,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:36:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118422902] [2023-08-24 05:36:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:46,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:36:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:46,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:36:46,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:36:46,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-08-24 05:36:46,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 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-24 05:36:46,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:46,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-08-24 05:36:46,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:46,810 INFO L124 PetriNetUnfolderBase]: 1118/1698 cut-off events. [2023-08-24 05:36:46,810 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2023-08-24 05:36:46,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3758 conditions, 1698 events. 1118/1698 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7404 event pairs, 249 based on Foata normal form. 60/1754 useless extension candidates. Maximal degree in co-relation 3745. Up to 1241 conditions per place. [2023-08-24 05:36:46,820 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 30 selfloop transitions, 2 changer transitions 15/48 dead transitions. [2023-08-24 05:36:46,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 213 flow [2023-08-24 05:36:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:36:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:36:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2023-08-24 05:36:46,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417910447761194 [2023-08-24 05:36:46,823 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 444 transitions. [2023-08-24 05:36:46,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 444 transitions. [2023-08-24 05:36:46,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:46,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 444 transitions. [2023-08-24 05:36:46,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 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-24 05:36:46,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-24 05:36:46,827 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-24 05:36:46,827 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 64 flow. Second operand 5 states and 444 transitions. [2023-08-24 05:36:46,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 213 flow [2023-08-24 05:36:46,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 203 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 05:36:46,833 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 68 flow [2023-08-24 05:36:46,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-08-24 05:36:46,833 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-08-24 05:36:46,834 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 68 flow [2023-08-24 05:36:46,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 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-24 05:36:46,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:46,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:46,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:36:46,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:46,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1485117255, now seen corresponding path program 1 times [2023-08-24 05:36:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471194804] [2023-08-24 05:36:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:46,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:47,485 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-24 05:36:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471194804] [2023-08-24 05:36:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471194804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:36:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515058843] [2023-08-24 05:36:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:47,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:36:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:47,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:36:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:36:47,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 201 [2023-08-24 05:36:47,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 68 flow. Second operand has 8 states, 8 states have (on average 83.75) internal successors, (670), 8 states have internal predecessors, (670), 0 states have call successors, (0), 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-24 05:36:47,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:47,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 201 [2023-08-24 05:36:47,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:48,130 INFO L124 PetriNetUnfolderBase]: 1866/2794 cut-off events. [2023-08-24 05:36:48,130 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2023-08-24 05:36:48,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6280 conditions, 2794 events. 1866/2794 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13206 event pairs, 92 based on Foata normal form. 72/2866 useless extension candidates. Maximal degree in co-relation 6266. Up to 939 conditions per place. [2023-08-24 05:36:48,141 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 54 selfloop transitions, 7 changer transitions 44/105 dead transitions. [2023-08-24 05:36:48,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 479 flow [2023-08-24 05:36:48,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 05:36:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 05:36:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 929 transitions. [2023-08-24 05:36:48,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621890547263682 [2023-08-24 05:36:48,144 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 929 transitions. [2023-08-24 05:36:48,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 929 transitions. [2023-08-24 05:36:48,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:48,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 929 transitions. [2023-08-24 05:36:48,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.9) internal successors, (929), 10 states have internal predecessors, (929), 0 states have call successors, (0), 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-24 05:36:48,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 201.0) internal successors, (2211), 11 states have internal predecessors, (2211), 0 states have call successors, (0), 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-24 05:36:48,151 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 201.0) internal successors, (2211), 11 states have internal predecessors, (2211), 0 states have call successors, (0), 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-24 05:36:48,151 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 68 flow. Second operand 10 states and 929 transitions. [2023-08-24 05:36:48,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 479 flow [2023-08-24 05:36:48,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 105 transitions, 465 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 05:36:48,157 INFO L231 Difference]: Finished difference. Result has 49 places, 26 transitions, 116 flow [2023-08-24 05:36:48,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=116, PETRI_PLACES=49, PETRI_TRANSITIONS=26} [2023-08-24 05:36:48,158 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-08-24 05:36:48,158 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 26 transitions, 116 flow [2023-08-24 05:36:48,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.75) internal successors, (670), 8 states have internal predecessors, (670), 0 states have call successors, (0), 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-24 05:36:48,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:48,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:48,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:36:48,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:48,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1679342208, now seen corresponding path program 1 times [2023-08-24 05:36:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687876207] [2023-08-24 05:36:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:49,440 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-24 05:36:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687876207] [2023-08-24 05:36:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687876207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:36:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248609259] [2023-08-24 05:36:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:49,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:36:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:49,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:36:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:36:49,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 201 [2023-08-24 05:36:49,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 26 transitions, 116 flow. Second operand has 10 states, 10 states have (on average 79.5) internal successors, (795), 10 states have internal predecessors, (795), 0 states have call successors, (0), 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-24 05:36:49,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:49,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 201 [2023-08-24 05:36:49,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:50,065 INFO L124 PetriNetUnfolderBase]: 939/1475 cut-off events. [2023-08-24 05:36:50,065 INFO L125 PetriNetUnfolderBase]: For 1697/1697 co-relation queries the response was YES. [2023-08-24 05:36:50,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4159 conditions, 1475 events. 939/1475 cut-off events. For 1697/1697 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6190 event pairs, 131 based on Foata normal form. 40/1515 useless extension candidates. Maximal degree in co-relation 4139. Up to 1179 conditions per place. [2023-08-24 05:36:50,074 INFO L140 encePairwiseOnDemand]: 188/201 looper letters, 50 selfloop transitions, 18 changer transitions 17/86 dead transitions. [2023-08-24 05:36:50,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 86 transitions, 490 flow [2023-08-24 05:36:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 05:36:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 05:36:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 866 transitions. [2023-08-24 05:36:50,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43084577114427863 [2023-08-24 05:36:50,077 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 866 transitions. [2023-08-24 05:36:50,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 866 transitions. [2023-08-24 05:36:50,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:50,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 866 transitions. [2023-08-24 05:36:50,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 86.6) internal successors, (866), 10 states have internal predecessors, (866), 0 states have call successors, (0), 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-24 05:36:50,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 201.0) internal successors, (2211), 11 states have internal predecessors, (2211), 0 states have call successors, (0), 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-24 05:36:50,082 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 201.0) internal successors, (2211), 11 states have internal predecessors, (2211), 0 states have call successors, (0), 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-24 05:36:50,082 INFO L175 Difference]: Start difference. First operand has 49 places, 26 transitions, 116 flow. Second operand 10 states and 866 transitions. [2023-08-24 05:36:50,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 86 transitions, 490 flow [2023-08-24 05:36:50,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 452 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-24 05:36:50,087 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 228 flow [2023-08-24 05:36:50,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-24 05:36:50,088 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2023-08-24 05:36:50,088 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 228 flow [2023-08-24 05:36:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 79.5) internal successors, (795), 10 states have internal predecessors, (795), 0 states have call successors, (0), 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-24 05:36:50,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:50,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:50,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:36:50,089 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:50,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1415879366, now seen corresponding path program 2 times [2023-08-24 05:36:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:50,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036037540] [2023-08-24 05:36:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:50,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:51,219 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-24 05:36:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036037540] [2023-08-24 05:36:51,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036037540] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:51,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:51,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:36:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287393601] [2023-08-24 05:36:51,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:51,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:36:51,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:51,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:36:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:36:51,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 201 [2023-08-24 05:36:51,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 81.875) internal successors, (655), 8 states have internal predecessors, (655), 0 states have call successors, (0), 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-24 05:36:51,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:51,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 201 [2023-08-24 05:36:51,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:51,797 INFO L124 PetriNetUnfolderBase]: 958/1502 cut-off events. [2023-08-24 05:36:51,797 INFO L125 PetriNetUnfolderBase]: For 3095/3095 co-relation queries the response was YES. [2023-08-24 05:36:51,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 1502 events. 958/1502 cut-off events. For 3095/3095 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6297 event pairs, 173 based on Foata normal form. 36/1538 useless extension candidates. Maximal degree in co-relation 5386. Up to 1193 conditions per place. [2023-08-24 05:36:51,807 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 58 selfloop transitions, 24 changer transitions 11/94 dead transitions. [2023-08-24 05:36:51,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 674 flow [2023-08-24 05:36:51,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:36:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:36:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 798 transitions. [2023-08-24 05:36:51,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44112769485903813 [2023-08-24 05:36:51,810 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 798 transitions. [2023-08-24 05:36:51,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 798 transitions. [2023-08-24 05:36:51,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:51,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 798 transitions. [2023-08-24 05:36:51,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.66666666666667) internal successors, (798), 9 states have internal predecessors, (798), 0 states have call successors, (0), 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-24 05:36:51,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:36:51,815 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:36:51,816 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 228 flow. Second operand 9 states and 798 transitions. [2023-08-24 05:36:51,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 674 flow [2023-08-24 05:36:51,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 662 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 05:36:51,823 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 378 flow [2023-08-24 05:36:51,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-08-24 05:36:51,826 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2023-08-24 05:36:51,826 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 378 flow [2023-08-24 05:36:51,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.875) internal successors, (655), 8 states have internal predecessors, (655), 0 states have call successors, (0), 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-24 05:36:51,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:51,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:51,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:36:51,826 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:51,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1145863986, now seen corresponding path program 3 times [2023-08-24 05:36:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349905985] [2023-08-24 05:36:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:52,652 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-24 05:36:52,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:52,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349905985] [2023-08-24 05:36:52,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349905985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:52,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:52,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:36:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689697432] [2023-08-24 05:36:52,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:52,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:36:52,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:52,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:36:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:36:52,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-08-24 05:36:52,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 84.875) internal successors, (679), 8 states have internal predecessors, (679), 0 states have call successors, (0), 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-24 05:36:52,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:52,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-08-24 05:36:52,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:53,154 INFO L124 PetriNetUnfolderBase]: 1046/1628 cut-off events. [2023-08-24 05:36:53,154 INFO L125 PetriNetUnfolderBase]: For 5580/5590 co-relation queries the response was YES. [2023-08-24 05:36:53,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6834 conditions, 1628 events. 1046/1628 cut-off events. For 5580/5590 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6968 event pairs, 167 based on Foata normal form. 39/1664 useless extension candidates. Maximal degree in co-relation 6807. Up to 1142 conditions per place. [2023-08-24 05:36:53,168 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 67 selfloop transitions, 24 changer transitions 17/109 dead transitions. [2023-08-24 05:36:53,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 109 transitions, 950 flow [2023-08-24 05:36:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:36:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:36:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 828 transitions. [2023-08-24 05:36:53,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577114427860697 [2023-08-24 05:36:53,171 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 828 transitions. [2023-08-24 05:36:53,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 828 transitions. [2023-08-24 05:36:53,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:53,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 828 transitions. [2023-08-24 05:36:53,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.0) internal successors, (828), 9 states have internal predecessors, (828), 0 states have call successors, (0), 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-24 05:36:53,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:36:53,176 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:36:53,176 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 378 flow. Second operand 9 states and 828 transitions. [2023-08-24 05:36:53,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 109 transitions, 950 flow [2023-08-24 05:36:53,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 109 transitions, 896 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-08-24 05:36:53,187 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 474 flow [2023-08-24 05:36:53,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=474, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2023-08-24 05:36:53,188 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-08-24 05:36:53,188 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 474 flow [2023-08-24 05:36:53,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.875) internal successors, (679), 8 states have internal predecessors, (679), 0 states have call successors, (0), 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-24 05:36:53,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:53,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:53,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:36:53,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:53,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1420670094, now seen corresponding path program 1 times [2023-08-24 05:36:53,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:53,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849643340] [2023-08-24 05:36:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:53,365 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-24 05:36:53,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849643340] [2023-08-24 05:36:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849643340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:53,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:53,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:36:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162796080] [2023-08-24 05:36:53,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:53,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:36:53,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:53,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:36:53,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:36:53,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-24 05:36:53,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 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-24 05:36:53,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:53,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-24 05:36:53,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:53,584 INFO L124 PetriNetUnfolderBase]: 782/1270 cut-off events. [2023-08-24 05:36:53,584 INFO L125 PetriNetUnfolderBase]: For 5128/5128 co-relation queries the response was YES. [2023-08-24 05:36:53,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5542 conditions, 1270 events. 782/1270 cut-off events. For 5128/5128 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5652 event pairs, 120 based on Foata normal form. 119/1388 useless extension candidates. Maximal degree in co-relation 5512. Up to 637 conditions per place. [2023-08-24 05:36:53,593 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 77 selfloop transitions, 4 changer transitions 65/147 dead transitions. [2023-08-24 05:36:53,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 147 transitions, 1449 flow [2023-08-24 05:36:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:36:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:36:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2023-08-24 05:36:53,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925373134328358 [2023-08-24 05:36:53,595 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2023-08-24 05:36:53,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2023-08-24 05:36:53,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:53,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2023-08-24 05:36:53,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-24 05:36:53,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-24 05:36:53,598 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-24 05:36:53,598 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 474 flow. Second operand 5 states and 495 transitions. [2023-08-24 05:36:53,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 147 transitions, 1449 flow [2023-08-24 05:36:53,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 147 transitions, 1429 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-24 05:36:53,605 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 493 flow [2023-08-24 05:36:53,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=493, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2023-08-24 05:36:53,606 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-08-24 05:36:53,606 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 493 flow [2023-08-24 05:36:53,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 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-24 05:36:53,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:53,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:53,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:36:53,607 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:53,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1344843097, now seen corresponding path program 1 times [2023-08-24 05:36:53,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615333539] [2023-08-24 05:36:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:53,789 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-24 05:36:53,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615333539] [2023-08-24 05:36:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615333539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:53,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:53,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:36:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258435837] [2023-08-24 05:36:53,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:53,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:36:53,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:53,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:36:53,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:36:53,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-24 05:36:53,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 493 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 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-24 05:36:53,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:53,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-24 05:36:53,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:54,012 INFO L124 PetriNetUnfolderBase]: 408/715 cut-off events. [2023-08-24 05:36:54,013 INFO L125 PetriNetUnfolderBase]: For 2758/2758 co-relation queries the response was YES. [2023-08-24 05:36:54,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 715 events. 408/715 cut-off events. For 2758/2758 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2939 event pairs, 78 based on Foata normal form. 56/770 useless extension candidates. Maximal degree in co-relation 3380. Up to 278 conditions per place. [2023-08-24 05:36:54,018 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 84 selfloop transitions, 7 changer transitions 32/124 dead transitions. [2023-08-24 05:36:54,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 124 transitions, 1209 flow [2023-08-24 05:36:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:36:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:36:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2023-08-24 05:36:54,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4917081260364842 [2023-08-24 05:36:54,020 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2023-08-24 05:36:54,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2023-08-24 05:36:54,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:54,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2023-08-24 05:36:54,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 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-24 05:36:54,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 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-24 05:36:54,024 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 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-24 05:36:54,024 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 493 flow. Second operand 6 states and 593 transitions. [2023-08-24 05:36:54,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 124 transitions, 1209 flow [2023-08-24 05:36:54,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 124 transitions, 1155 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-24 05:36:54,030 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 481 flow [2023-08-24 05:36:54,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2023-08-24 05:36:54,031 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-08-24 05:36:54,031 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 481 flow [2023-08-24 05:36:54,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 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-24 05:36:54,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:54,032 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] [2023-08-24 05:36:54,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:36:54,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:54,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1310864119, now seen corresponding path program 1 times [2023-08-24 05:36:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:54,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83509364] [2023-08-24 05:36:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:54,234 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-24 05:36:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83509364] [2023-08-24 05:36:54,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83509364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:54,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:54,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:36:54,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359680352] [2023-08-24 05:36:54,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:54,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:36:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:54,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:36:54,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:36:54,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-24 05:36:54,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 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-24 05:36:54,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:54,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-24 05:36:54,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:54,433 INFO L124 PetriNetUnfolderBase]: 296/523 cut-off events. [2023-08-24 05:36:54,433 INFO L125 PetriNetUnfolderBase]: For 1833/1833 co-relation queries the response was YES. [2023-08-24 05:36:54,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2496 conditions, 523 events. 296/523 cut-off events. For 1833/1833 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2047 event pairs, 74 based on Foata normal form. 12/534 useless extension candidates. Maximal degree in co-relation 2465. Up to 278 conditions per place. [2023-08-24 05:36:54,442 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 81 selfloop transitions, 10 changer transitions 12/104 dead transitions. [2023-08-24 05:36:54,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 1008 flow [2023-08-24 05:36:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:36:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:36:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 667 transitions. [2023-08-24 05:36:54,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47405828002842926 [2023-08-24 05:36:54,444 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 667 transitions. [2023-08-24 05:36:54,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 667 transitions. [2023-08-24 05:36:54,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:54,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 667 transitions. [2023-08-24 05:36:54,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 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-24 05:36:54,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 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-24 05:36:54,448 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 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-24 05:36:54,448 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 481 flow. Second operand 7 states and 667 transitions. [2023-08-24 05:36:54,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 1008 flow [2023-08-24 05:36:54,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 934 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-24 05:36:54,454 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 457 flow [2023-08-24 05:36:54,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=457, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-08-24 05:36:54,455 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-08-24 05:36:54,455 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 457 flow [2023-08-24 05:36:54,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 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-24 05:36:54,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:54,456 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] [2023-08-24 05:36:54,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:36:54,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:54,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash -169460167, now seen corresponding path program 1 times [2023-08-24 05:36:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:54,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026329385] [2023-08-24 05:36:54,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:55,600 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-24 05:36:55,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:55,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026329385] [2023-08-24 05:36:55,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026329385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:55,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:55,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:36:55,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619036371] [2023-08-24 05:36:55,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:55,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:36:55,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:55,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:36:55,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:36:55,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 201 [2023-08-24 05:36:55,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 457 flow. Second operand has 8 states, 8 states have (on average 78.75) internal successors, (630), 8 states have internal predecessors, (630), 0 states have call successors, (0), 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-24 05:36:55,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:55,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 201 [2023-08-24 05:36:55,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:55,970 INFO L124 PetriNetUnfolderBase]: 446/818 cut-off events. [2023-08-24 05:36:55,971 INFO L125 PetriNetUnfolderBase]: For 2721/2721 co-relation queries the response was YES. [2023-08-24 05:36:55,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3766 conditions, 818 events. 446/818 cut-off events. For 2721/2721 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3753 event pairs, 40 based on Foata normal form. 1/819 useless extension candidates. Maximal degree in co-relation 3736. Up to 402 conditions per place. [2023-08-24 05:36:55,977 INFO L140 encePairwiseOnDemand]: 190/201 looper letters, 68 selfloop transitions, 29 changer transitions 33/131 dead transitions. [2023-08-24 05:36:55,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 131 transitions, 1242 flow [2023-08-24 05:36:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:36:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:36:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 759 transitions. [2023-08-24 05:36:55,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41956882255389716 [2023-08-24 05:36:55,980 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 759 transitions. [2023-08-24 05:36:55,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 759 transitions. [2023-08-24 05:36:55,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:55,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 759 transitions. [2023-08-24 05:36:55,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.33333333333333) internal successors, (759), 9 states have internal predecessors, (759), 0 states have call successors, (0), 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-24 05:36:55,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:36:55,985 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:36:55,985 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 457 flow. Second operand 9 states and 759 transitions. [2023-08-24 05:36:55,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 131 transitions, 1242 flow [2023-08-24 05:36:55,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 131 transitions, 1032 flow, removed 75 selfloop flow, removed 9 redundant places. [2023-08-24 05:36:55,994 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 586 flow [2023-08-24 05:36:55,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=586, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2023-08-24 05:36:55,995 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2023-08-24 05:36:55,995 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 586 flow [2023-08-24 05:36:55,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.75) internal successors, (630), 8 states have internal predecessors, (630), 0 states have call successors, (0), 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-24 05:36:55,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:55,995 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] [2023-08-24 05:36:55,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:36:55,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:55,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1632326081, now seen corresponding path program 2 times [2023-08-24 05:36:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:55,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767815708] [2023-08-24 05:36:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:57,083 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-24 05:36:57,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767815708] [2023-08-24 05:36:57,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767815708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:57,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:57,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:36:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021642962] [2023-08-24 05:36:57,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:57,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:36:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:36:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:36:57,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-08-24 05:36:57,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 586 flow. Second operand has 10 states, 10 states have (on average 85.2) internal successors, (852), 10 states have internal predecessors, (852), 0 states have call successors, (0), 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-24 05:36:57,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:57,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-08-24 05:36:57,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:57,367 INFO L124 PetriNetUnfolderBase]: 419/769 cut-off events. [2023-08-24 05:36:57,367 INFO L125 PetriNetUnfolderBase]: For 2493/2493 co-relation queries the response was YES. [2023-08-24 05:36:57,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 769 events. 419/769 cut-off events. For 2493/2493 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3485 event pairs, 57 based on Foata normal form. 1/770 useless extension candidates. Maximal degree in co-relation 3579. Up to 486 conditions per place. [2023-08-24 05:36:57,373 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 61 selfloop transitions, 14 changer transitions 37/113 dead transitions. [2023-08-24 05:36:57,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 113 transitions, 1064 flow [2023-08-24 05:36:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:36:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:36:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 726 transitions. [2023-08-24 05:36:57,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45149253731343286 [2023-08-24 05:36:57,375 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 726 transitions. [2023-08-24 05:36:57,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 726 transitions. [2023-08-24 05:36:57,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:57,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 726 transitions. [2023-08-24 05:36:57,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 0 states have call successors, (0), 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-24 05:36:57,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 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-24 05:36:57,379 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 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-24 05:36:57,380 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 586 flow. Second operand 8 states and 726 transitions. [2023-08-24 05:36:57,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 113 transitions, 1064 flow [2023-08-24 05:36:57,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 113 transitions, 1015 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-24 05:36:57,388 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 558 flow [2023-08-24 05:36:57,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2023-08-24 05:36:57,390 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2023-08-24 05:36:57,390 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 558 flow [2023-08-24 05:36:57,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.2) internal successors, (852), 10 states have internal predecessors, (852), 0 states have call successors, (0), 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-24 05:36:57,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:57,390 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] [2023-08-24 05:36:57,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:36:57,391 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:57,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash -265911771, now seen corresponding path program 3 times [2023-08-24 05:36:57,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:57,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262166117] [2023-08-24 05:36:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:58,261 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-24 05:36:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262166117] [2023-08-24 05:36:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262166117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:58,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:36:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274906211] [2023-08-24 05:36:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:58,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 05:36:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 05:36:58,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-24 05:36:58,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-08-24 05:36:58,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 558 flow. Second operand has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 9 states have internal predecessors, (751), 0 states have call successors, (0), 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-24 05:36:58,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:58,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-08-24 05:36:58,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:58,594 INFO L124 PetriNetUnfolderBase]: 408/757 cut-off events. [2023-08-24 05:36:58,594 INFO L125 PetriNetUnfolderBase]: For 2481/2481 co-relation queries the response was YES. [2023-08-24 05:36:58,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 757 events. 408/757 cut-off events. For 2481/2481 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3457 event pairs, 74 based on Foata normal form. 1/758 useless extension candidates. Maximal degree in co-relation 3372. Up to 305 conditions per place. [2023-08-24 05:36:58,600 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 71 selfloop transitions, 11 changer transitions 26/109 dead transitions. [2023-08-24 05:36:58,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 1014 flow [2023-08-24 05:36:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:36:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:36:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 705 transitions. [2023-08-24 05:36:58,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43843283582089554 [2023-08-24 05:36:58,603 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 705 transitions. [2023-08-24 05:36:58,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 705 transitions. [2023-08-24 05:36:58,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:58,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 705 transitions. [2023-08-24 05:36:58,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.125) internal successors, (705), 8 states have internal predecessors, (705), 0 states have call successors, (0), 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-24 05:36:58,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 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-24 05:36:58,608 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 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-24 05:36:58,608 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 558 flow. Second operand 8 states and 705 transitions. [2023-08-24 05:36:58,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 1014 flow [2023-08-24 05:36:58,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 973 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-24 05:36:58,617 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 456 flow [2023-08-24 05:36:58,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=456, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-08-24 05:36:58,618 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2023-08-24 05:36:58,619 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 456 flow [2023-08-24 05:36:58,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 9 states have internal predecessors, (751), 0 states have call successors, (0), 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-24 05:36:58,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:58,619 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] [2023-08-24 05:36:58,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:36:58,619 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:58,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash -766836589, now seen corresponding path program 4 times [2023-08-24 05:36:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864242672] [2023-08-24 05:36:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:00,244 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-24 05:37:00,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864242672] [2023-08-24 05:37:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864242672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:00,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:00,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-24 05:37:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542182098] [2023-08-24 05:37:00,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:00,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 05:37:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 05:37:00,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-08-24 05:37:00,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 201 [2023-08-24 05:37:00,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 456 flow. Second operand has 12 states, 12 states have (on average 76.83333333333333) internal successors, (922), 12 states have internal predecessors, (922), 0 states have call successors, (0), 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-24 05:37:00,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:00,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 201 [2023-08-24 05:37:00,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:00,680 INFO L124 PetriNetUnfolderBase]: 263/542 cut-off events. [2023-08-24 05:37:00,680 INFO L125 PetriNetUnfolderBase]: For 1676/1676 co-relation queries the response was YES. [2023-08-24 05:37:00,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 542 events. 263/542 cut-off events. For 1676/1676 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2477 event pairs, 48 based on Foata normal form. 1/543 useless extension candidates. Maximal degree in co-relation 2347. Up to 229 conditions per place. [2023-08-24 05:37:00,684 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 63 selfloop transitions, 8 changer transitions 37/109 dead transitions. [2023-08-24 05:37:00,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 944 flow [2023-08-24 05:37:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:37:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:37:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 894 transitions. [2023-08-24 05:37:00,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4043419267299864 [2023-08-24 05:37:00,687 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 894 transitions. [2023-08-24 05:37:00,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 894 transitions. [2023-08-24 05:37:00,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:00,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 894 transitions. [2023-08-24 05:37:00,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.27272727272727) internal successors, (894), 11 states have internal predecessors, (894), 0 states have call successors, (0), 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-24 05:37:00,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 201.0) internal successors, (2412), 12 states have internal predecessors, (2412), 0 states have call successors, (0), 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-24 05:37:00,693 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 201.0) internal successors, (2412), 12 states have internal predecessors, (2412), 0 states have call successors, (0), 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-24 05:37:00,693 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 456 flow. Second operand 11 states and 894 transitions. [2023-08-24 05:37:00,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 944 flow [2023-08-24 05:37:00,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 917 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-24 05:37:00,699 INFO L231 Difference]: Finished difference. Result has 80 places, 54 transitions, 428 flow [2023-08-24 05:37:00,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=428, PETRI_PLACES=80, PETRI_TRANSITIONS=54} [2023-08-24 05:37:00,700 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 45 predicate places. [2023-08-24 05:37:00,700 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 428 flow [2023-08-24 05:37:00,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 76.83333333333333) internal successors, (922), 12 states have internal predecessors, (922), 0 states have call successors, (0), 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-24 05:37:00,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:00,701 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] [2023-08-24 05:37:00,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:37:00,701 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:37:00,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1744929459, now seen corresponding path program 5 times [2023-08-24 05:37:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:00,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771622698] [2023-08-24 05:37:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:02,350 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-24 05:37:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:02,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771622698] [2023-08-24 05:37:02,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771622698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:02,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:02,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-24 05:37:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641518256] [2023-08-24 05:37:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 05:37:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 05:37:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-08-24 05:37:02,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 201 [2023-08-24 05:37:02,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 54 transitions, 428 flow. Second operand has 11 states, 11 states have (on average 79.0) internal successors, (869), 11 states have internal predecessors, (869), 0 states have call successors, (0), 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-24 05:37:02,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:02,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 201 [2023-08-24 05:37:02,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:02,742 INFO L124 PetriNetUnfolderBase]: 259/515 cut-off events. [2023-08-24 05:37:02,742 INFO L125 PetriNetUnfolderBase]: For 1571/1571 co-relation queries the response was YES. [2023-08-24 05:37:02,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2318 conditions, 515 events. 259/515 cut-off events. For 1571/1571 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2223 event pairs, 56 based on Foata normal form. 1/516 useless extension candidates. Maximal degree in co-relation 2292. Up to 223 conditions per place. [2023-08-24 05:37:02,745 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 61 selfloop transitions, 13 changer transitions 22/97 dead transitions. [2023-08-24 05:37:02,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 97 transitions, 852 flow [2023-08-24 05:37:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:37:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:37:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 760 transitions. [2023-08-24 05:37:02,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201216141514649 [2023-08-24 05:37:02,748 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 760 transitions. [2023-08-24 05:37:02,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 760 transitions. [2023-08-24 05:37:02,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:02,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 760 transitions. [2023-08-24 05:37:02,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 0 states have call successors, (0), 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-24 05:37:02,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:37:02,752 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:37:02,752 INFO L175 Difference]: Start difference. First operand has 80 places, 54 transitions, 428 flow. Second operand 9 states and 760 transitions. [2023-08-24 05:37:02,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 97 transitions, 852 flow [2023-08-24 05:37:02,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 817 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-08-24 05:37:02,758 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 428 flow [2023-08-24 05:37:02,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=428, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2023-08-24 05:37:02,759 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2023-08-24 05:37:02,759 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 428 flow [2023-08-24 05:37:02,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.0) internal successors, (869), 11 states have internal predecessors, (869), 0 states have call successors, (0), 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-24 05:37:02,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:02,759 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] [2023-08-24 05:37:02,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:37:02,760 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:37:02,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1405137223, now seen corresponding path program 6 times [2023-08-24 05:37:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352571245] [2023-08-24 05:37:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:03,666 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-24 05:37:03,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352571245] [2023-08-24 05:37:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352571245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:03,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:03,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:37:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269982506] [2023-08-24 05:37:03,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:03,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 05:37:03,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:03,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 05:37:03,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-24 05:37:03,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 201 [2023-08-24 05:37:03,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 428 flow. Second operand has 9 states, 9 states have (on average 78.44444444444444) internal successors, (706), 9 states have internal predecessors, (706), 0 states have call successors, (0), 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-24 05:37:03,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:03,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 201 [2023-08-24 05:37:03,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:03,962 INFO L124 PetriNetUnfolderBase]: 245/482 cut-off events. [2023-08-24 05:37:03,962 INFO L125 PetriNetUnfolderBase]: For 1638/1638 co-relation queries the response was YES. [2023-08-24 05:37:03,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 482 events. 245/482 cut-off events. For 1638/1638 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2006 event pairs, 103 based on Foata normal form. 1/483 useless extension candidates. Maximal degree in co-relation 2158. Up to 370 conditions per place. [2023-08-24 05:37:03,965 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 46 selfloop transitions, 2 changer transitions 36/85 dead transitions. [2023-08-24 05:37:03,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 773 flow [2023-08-24 05:37:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:37:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:37:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 659 transitions. [2023-08-24 05:37:03,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4098258706467662 [2023-08-24 05:37:03,966 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 659 transitions. [2023-08-24 05:37:03,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 659 transitions. [2023-08-24 05:37:03,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:03,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 659 transitions. [2023-08-24 05:37:03,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 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-24 05:37:03,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 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-24 05:37:03,970 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 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-24 05:37:03,970 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 428 flow. Second operand 8 states and 659 transitions. [2023-08-24 05:37:03,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 773 flow [2023-08-24 05:37:03,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 85 transitions, 726 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-08-24 05:37:03,976 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 353 flow [2023-08-24 05:37:03,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=353, PETRI_PLACES=76, PETRI_TRANSITIONS=47} [2023-08-24 05:37:03,977 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2023-08-24 05:37:03,977 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 353 flow [2023-08-24 05:37:03,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 78.44444444444444) internal successors, (706), 9 states have internal predecessors, (706), 0 states have call successors, (0), 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-24 05:37:03,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:03,977 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] [2023-08-24 05:37:03,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 05:37:03,977 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:37:03,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1855910753, now seen corresponding path program 7 times [2023-08-24 05:37:03,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:03,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766820954] [2023-08-24 05:37:03,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:03,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:05,099 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-24 05:37:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:05,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766820954] [2023-08-24 05:37:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766820954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:05,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-24 05:37:05,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20016417] [2023-08-24 05:37:05,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:05,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 05:37:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:05,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 05:37:05,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-24 05:37:05,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 201 [2023-08-24 05:37:05,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 47 transitions, 353 flow. Second operand has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 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-24 05:37:05,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:05,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 201 [2023-08-24 05:37:05,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:05,542 INFO L124 PetriNetUnfolderBase]: 263/512 cut-off events. [2023-08-24 05:37:05,542 INFO L125 PetriNetUnfolderBase]: For 1387/1387 co-relation queries the response was YES. [2023-08-24 05:37:05,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 512 events. 263/512 cut-off events. For 1387/1387 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2214 event pairs, 10 based on Foata normal form. 1/513 useless extension candidates. Maximal degree in co-relation 2195. Up to 216 conditions per place. [2023-08-24 05:37:05,545 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 47 selfloop transitions, 7 changer transitions 51/106 dead transitions. [2023-08-24 05:37:05,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 903 flow [2023-08-24 05:37:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:37:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:37:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 764 transitions. [2023-08-24 05:37:05,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4223327805417358 [2023-08-24 05:37:05,547 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 764 transitions. [2023-08-24 05:37:05,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 764 transitions. [2023-08-24 05:37:05,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:05,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 764 transitions. [2023-08-24 05:37:05,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.88888888888889) internal successors, (764), 9 states have internal predecessors, (764), 0 states have call successors, (0), 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-24 05:37:05,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:37:05,560 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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-24 05:37:05,560 INFO L175 Difference]: Start difference. First operand has 76 places, 47 transitions, 353 flow. Second operand 9 states and 764 transitions. [2023-08-24 05:37:05,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 903 flow [2023-08-24 05:37:05,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 883 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-24 05:37:05,566 INFO L231 Difference]: Finished difference. Result has 73 places, 35 transitions, 240 flow [2023-08-24 05:37:05,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=73, PETRI_TRANSITIONS=35} [2023-08-24 05:37:05,566 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2023-08-24 05:37:05,566 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 35 transitions, 240 flow [2023-08-24 05:37:05,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 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-24 05:37:05,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:05,567 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] [2023-08-24 05:37:05,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 05:37:05,567 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:37:05,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash 541129979, now seen corresponding path program 8 times [2023-08-24 05:37:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:05,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695468968] [2023-08-24 05:37:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:05,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:07,003 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-24 05:37:07,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:07,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695468968] [2023-08-24 05:37:07,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695468968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:07,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-24 05:37:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723323035] [2023-08-24 05:37:07,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:07,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 05:37:07,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 05:37:07,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-08-24 05:37:07,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 201 [2023-08-24 05:37:07,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 35 transitions, 240 flow. Second operand has 13 states, 13 states have (on average 78.6923076923077) internal successors, (1023), 13 states have internal predecessors, (1023), 0 states have call successors, (0), 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-24 05:37:07,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:07,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 201 [2023-08-24 05:37:07,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:07,466 INFO L124 PetriNetUnfolderBase]: 144/318 cut-off events. [2023-08-24 05:37:07,466 INFO L125 PetriNetUnfolderBase]: For 815/815 co-relation queries the response was YES. [2023-08-24 05:37:07,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 318 events. 144/318 cut-off events. For 815/815 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1374 event pairs, 9 based on Foata normal form. 3/321 useless extension candidates. Maximal degree in co-relation 1351. Up to 88 conditions per place. [2023-08-24 05:37:07,468 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 33 selfloop transitions, 3 changer transitions 52/89 dead transitions. [2023-08-24 05:37:07,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 711 flow [2023-08-24 05:37:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:37:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:37:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 908 transitions. [2023-08-24 05:37:07,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41067390321121666 [2023-08-24 05:37:07,470 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 908 transitions. [2023-08-24 05:37:07,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 908 transitions. [2023-08-24 05:37:07,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:07,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 908 transitions. [2023-08-24 05:37:07,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 82.54545454545455) internal successors, (908), 11 states have internal predecessors, (908), 0 states have call successors, (0), 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-24 05:37:07,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 201.0) internal successors, (2412), 12 states have internal predecessors, (2412), 0 states have call successors, (0), 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-24 05:37:07,475 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 201.0) internal successors, (2412), 12 states have internal predecessors, (2412), 0 states have call successors, (0), 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-24 05:37:07,475 INFO L175 Difference]: Start difference. First operand has 73 places, 35 transitions, 240 flow. Second operand 11 states and 908 transitions. [2023-08-24 05:37:07,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 711 flow [2023-08-24 05:37:07,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 633 flow, removed 18 selfloop flow, removed 19 redundant places. [2023-08-24 05:37:07,478 INFO L231 Difference]: Finished difference. Result has 67 places, 29 transitions, 167 flow [2023-08-24 05:37:07,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=167, PETRI_PLACES=67, PETRI_TRANSITIONS=29} [2023-08-24 05:37:07,479 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-08-24 05:37:07,479 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 29 transitions, 167 flow [2023-08-24 05:37:07,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.6923076923077) internal successors, (1023), 13 states have internal predecessors, (1023), 0 states have call successors, (0), 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-24 05:37:07,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:07,479 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] [2023-08-24 05:37:07,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 05:37:07,480 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:37:07,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1145765821, now seen corresponding path program 9 times [2023-08-24 05:37:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035879995] [2023-08-24 05:37:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:37:07,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:37:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:37:07,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:37:07,583 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:37:07,584 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:37:07,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:37:07,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:37:07,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:37:07,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:37:07,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:37:07,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 05:37:07,587 INFO L445 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:07,591 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:37:07,591 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:37:07,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:37:07 BasicIcfg [2023-08-24 05:37:07,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:37:07,640 INFO L158 Benchmark]: Toolchain (without parser) took 29409.25ms. Allocated memory was 352.3MB in the beginning and 1.0GB in the end (delta: 658.5MB). Free memory was 308.1MB in the beginning and 698.5MB in the end (delta: -390.4MB). Peak memory consumption was 270.2MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,640 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 352.3MB. Free memory was 329.8MB in the beginning and 329.8MB in the end (delta: 94.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:37:07,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.47ms. Allocated memory is still 352.3MB. Free memory was 308.1MB in the beginning and 281.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.84ms. Allocated memory is still 352.3MB. Free memory was 281.9MB in the beginning and 278.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,640 INFO L158 Benchmark]: Boogie Preprocessor took 30.61ms. Allocated memory is still 352.3MB. Free memory was 278.7MB in the beginning and 276.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,641 INFO L158 Benchmark]: RCFGBuilder took 707.15ms. Allocated memory is still 352.3MB. Free memory was 276.6MB in the beginning and 222.1MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,641 INFO L158 Benchmark]: TraceAbstraction took 28087.66ms. Allocated memory was 352.3MB in the beginning and 1.0GB in the end (delta: 658.5MB). Free memory was 222.1MB in the beginning and 698.5MB in the end (delta: -476.4MB). Peak memory consumption was 184.2MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,642 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 352.3MB. Free memory was 329.8MB in the beginning and 329.8MB in the end (delta: 94.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 532.47ms. Allocated memory is still 352.3MB. Free memory was 308.1MB in the beginning and 281.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.84ms. Allocated memory is still 352.3MB. Free memory was 281.9MB in the beginning and 278.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.61ms. Allocated memory is still 352.3MB. Free memory was 278.7MB in the beginning and 276.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 707.15ms. Allocated memory is still 352.3MB. Free memory was 276.6MB in the beginning and 222.1MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. * TraceAbstraction took 28087.66ms. Allocated memory was 352.3MB in the beginning and 1.0GB in the end (delta: 658.5MB). Free memory was 222.1MB in the beginning and 698.5MB in the end (delta: -476.4MB). Peak memory consumption was 184.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 114 PlacesBefore, 35 PlacesAfterwards, 106 TransitionsBefore, 26 TransitionsAfterwards, 2022 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 5460 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2070, independent: 1902, independent conditional: 0, independent unconditional: 1902, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1067, independent: 1029, independent conditional: 0, independent unconditional: 1029, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2070, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1067, unknown conditional: 0, unknown unconditional: 1067] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-2, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-1, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 830 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 830 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 335 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3167 IncrementalHoareTripleChecker+Invalid, 3502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 335 mSolverCounterUnsat, 2 mSDtfsCounter, 3167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=586occurred in iteration=11, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 4619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:37:07,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...