/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 -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-23 23:10:50,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:10:50,473 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-23 23:10:50,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:10:50,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:10:50,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:10:50,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:10:50,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:10:50,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:10:50,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:10:50,524 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:10:50,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:10:50,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:10:50,525 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:10:50,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:10:50,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:10:50,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:10:50,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:10:50,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:10:50,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:10:50,528 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:10:50,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:10:50,532 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:10:50,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:10:50,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:10:50,535 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:10:50,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:10:50,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:10:50,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:10:50,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:10:50,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:10:50,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:10:50,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:10:50,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:10:50,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:10:50,538 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 [2023-08-23 23:10:50,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:10:50,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:10:50,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:10:50,883 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:10:50,883 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:10:50,885 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-23 23:10:51,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:10:52,268 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:10:52,269 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-23 23:10:52,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b755ecbb0/6797af9fa0f74e7cb8a5a45d2ffc5e54/FLAG51aa06d24 [2023-08-23 23:10:52,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b755ecbb0/6797af9fa0f74e7cb8a5a45d2ffc5e54 [2023-08-23 23:10:52,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:10:52,299 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:10:52,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:10:52,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:10:52,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:10:52,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:52,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad8329a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52, skipping insertion in model container [2023-08-23 23:10:52,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:52,353 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:10:52,482 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-23 23:10:52,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:10:52,747 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:10:52,758 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-23 23:10:52,774 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:10:52,776 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:10:52,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:10:52,868 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:10:52,868 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:10:52,874 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:10:52,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52 WrapperNode [2023-08-23 23:10:52,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:10:52,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:10:52,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:10:52,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:10:52,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:52,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:52,950 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-23 23:10:52,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:10:52,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:10:52,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:10:52,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:10:52,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:52,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:52,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:52,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:52,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:52,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:53,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:53,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:53,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:10:53,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:10:53,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:10:53,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:10:53,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (1/1) ... [2023-08-23 23:10:53,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:10:53,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:10:53,046 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-23 23:10:53,069 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-23 23:10:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:10:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:10:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:10:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:10:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:10:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:10:53,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:10:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:10:53,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:10:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:10:53,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:10:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:10:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:10:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:10:53,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:10:53,091 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:10:53,254 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:10:53,256 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:10:53,652 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:10:53,799 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:10:53,800 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:10:53,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:10:53 BoogieIcfgContainer [2023-08-23 23:10:53,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:10:53,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:10:53,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:10:53,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:10:53,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:10:52" (1/3) ... [2023-08-23 23:10:53,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5213b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:10:53, skipping insertion in model container [2023-08-23 23:10:53,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:52" (2/3) ... [2023-08-23 23:10:53,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5213b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:10:53, skipping insertion in model container [2023-08-23 23:10:53,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:10:53" (3/3) ... [2023-08-23 23:10:53,810 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-23 23:10:53,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:10:53,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:10:53,825 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:10:53,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:10:53,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2023-08-23 23:10:53,969 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-08-23 23:10:53,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:10:53,975 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-23 23:10:53,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2023-08-23 23:10:53,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2023-08-23 23:10:53,986 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:10:53,998 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2023-08-23 23:10:54,000 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2023-08-23 23:10:54,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2023-08-23 23:10:54,028 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-08-23 23:10:54,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:10:54,029 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-23 23:10:54,031 INFO L119 LiptonReduction]: Number of co-enabled transitions 2022 [2023-08-23 23:10:57,470 INFO L134 LiptonReduction]: Checked pairs total: 5460 [2023-08-23 23:10:57,471 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-23 23:10:57,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:10:57,487 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;@5b789304, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:10:57,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-23 23:10:57,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:10:57,492 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-23 23:10:57,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:10:57,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:57,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-23 23:10:57,493 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-23 23:10:57,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 525870182, now seen corresponding path program 1 times [2023-08-23 23:10:57,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:57,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783833627] [2023-08-23 23:10:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:57,914 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-23 23:10:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783833627] [2023-08-23 23:10:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783833627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:57,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:10:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158506521] [2023-08-23 23:10:57,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:57,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:10:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:57,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:10:57,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:10:57,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 201 [2023-08-23 23:10:57,947 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-23 23:10:57,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:57,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 201 [2023-08-23 23:10:57,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:58,474 INFO L124 PetriNetUnfolderBase]: 1683/2656 cut-off events. [2023-08-23 23:10:58,475 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-23 23:10:58,482 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-23 23:10:58,496 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 35 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-08-23 23:10:58,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 170 flow [2023-08-23 23:10:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:10:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:10:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-23 23:10:58,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527363184079602 [2023-08-23 23:10:58,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-23 23:10:58,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-23 23:10:58,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:58,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-23 23:10:58,525 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-23 23:10:58,529 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-23 23:10:58,529 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-23 23:10:58,531 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 318 transitions. [2023-08-23 23:10:58,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 170 flow [2023-08-23 23:10:58,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 23:10:58,534 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-08-23 23:10:58,536 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-23 23:10:58,539 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-08-23 23:10:58,539 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-08-23 23:10:58,540 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-23 23:10:58,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:58,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:58,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:10:58,540 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-23 23:10:58,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash 648657845, now seen corresponding path program 1 times [2023-08-23 23:10:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:58,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012934369] [2023-08-23 23:10:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:58,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:59,653 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-23 23:10:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012934369] [2023-08-23 23:10:59,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012934369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:59,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:59,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:10:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978248345] [2023-08-23 23:10:59,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:59,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:10:59,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:59,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:10:59,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:10:59,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-08-23 23:10:59,657 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-23 23:10:59,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:59,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-08-23 23:10:59,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:00,059 INFO L124 PetriNetUnfolderBase]: 1317/1981 cut-off events. [2023-08-23 23:11:00,059 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-08-23 23:11:00,064 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-23 23:11:00,072 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 33 selfloop transitions, 2 changer transitions 20/56 dead transitions. [2023-08-23 23:11:00,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 242 flow [2023-08-23 23:11:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:11:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:11:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2023-08-23 23:11:00,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44975124378109455 [2023-08-23 23:11:00,076 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 452 transitions. [2023-08-23 23:11:00,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 452 transitions. [2023-08-23 23:11:00,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:00,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 452 transitions. [2023-08-23 23:11:00,077 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-23 23:11:00,081 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-23 23:11:00,081 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-23 23:11:00,082 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 5 states and 452 transitions. [2023-08-23 23:11:00,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 242 flow [2023-08-23 23:11:00,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:11:00,085 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 64 flow [2023-08-23 23:11:00,085 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-23 23:11:00,086 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-08-23 23:11:00,087 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 64 flow [2023-08-23 23:11:00,088 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-23 23:11:00,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:00,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:00,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:11:00,094 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-23 23:11:00,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1877775071, now seen corresponding path program 1 times [2023-08-23 23:11:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:00,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386760765] [2023-08-23 23:11:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:00,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:01,013 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-23 23:11:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386760765] [2023-08-23 23:11:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386760765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:11:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747299904] [2023-08-23 23:11:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:01,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:11:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:11:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:11:01,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-08-23 23:11:01,016 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-23 23:11:01,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:01,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-08-23 23:11:01,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:01,362 INFO L124 PetriNetUnfolderBase]: 1118/1698 cut-off events. [2023-08-23 23:11:01,362 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2023-08-23 23:11:01,365 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-23 23:11:01,372 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 30 selfloop transitions, 2 changer transitions 15/48 dead transitions. [2023-08-23 23:11:01,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 213 flow [2023-08-23 23:11:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:11:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:11:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2023-08-23 23:11:01,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417910447761194 [2023-08-23 23:11:01,374 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 444 transitions. [2023-08-23 23:11:01,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 444 transitions. [2023-08-23 23:11:01,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:01,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 444 transitions. [2023-08-23 23:11:01,375 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-23 23:11:01,377 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-23 23:11:01,378 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-23 23:11:01,378 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 64 flow. Second operand 5 states and 444 transitions. [2023-08-23 23:11:01,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 213 flow [2023-08-23 23:11:01,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 203 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-23 23:11:01,385 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 68 flow [2023-08-23 23:11:01,385 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-23 23:11:01,386 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-08-23 23:11:01,388 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 68 flow [2023-08-23 23:11:01,389 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-23 23:11:01,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:01,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:01,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:11:01,389 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-23 23:11:01,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1485117255, now seen corresponding path program 1 times [2023-08-23 23:11:01,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:01,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183693308] [2023-08-23 23:11:01,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:01,952 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-23 23:11:01,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:01,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183693308] [2023-08-23 23:11:01,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183693308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:01,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:01,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:11:01,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418831584] [2023-08-23 23:11:01,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:01,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:11:01,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:11:01,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:11:01,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 201 [2023-08-23 23:11:01,956 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-23 23:11:01,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:01,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 201 [2023-08-23 23:11:01,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:02,636 INFO L124 PetriNetUnfolderBase]: 1866/2794 cut-off events. [2023-08-23 23:11:02,636 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2023-08-23 23:11:02,640 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-23 23:11:02,648 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 54 selfloop transitions, 7 changer transitions 44/105 dead transitions. [2023-08-23 23:11:02,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 479 flow [2023-08-23 23:11:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-23 23:11:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-23 23:11:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 929 transitions. [2023-08-23 23:11:02,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621890547263682 [2023-08-23 23:11:02,651 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 929 transitions. [2023-08-23 23:11:02,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 929 transitions. [2023-08-23 23:11:02,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:02,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 929 transitions. [2023-08-23 23:11:02,654 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-23 23:11:02,657 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-23 23:11:02,659 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-23 23:11:02,659 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 68 flow. Second operand 10 states and 929 transitions. [2023-08-23 23:11:02,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 479 flow [2023-08-23 23:11:02,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 105 transitions, 465 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-23 23:11:02,668 INFO L231 Difference]: Finished difference. Result has 49 places, 26 transitions, 116 flow [2023-08-23 23:11:02,669 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-23 23:11:02,670 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-08-23 23:11:02,670 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 26 transitions, 116 flow [2023-08-23 23:11:02,672 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-23 23:11:02,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:02,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:02,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:11:02,672 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-23 23:11:02,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1679342208, now seen corresponding path program 1 times [2023-08-23 23:11:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:02,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023655470] [2023-08-23 23:11:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:04,124 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-23 23:11:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:04,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023655470] [2023-08-23 23:11:04,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023655470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:04,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:04,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-23 23:11:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565160562] [2023-08-23 23:11:04,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:04,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-23 23:11:04,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-23 23:11:04,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-23 23:11:04,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 201 [2023-08-23 23:11:04,128 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-23 23:11:04,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:04,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 201 [2023-08-23 23:11:04,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:04,773 INFO L124 PetriNetUnfolderBase]: 939/1475 cut-off events. [2023-08-23 23:11:04,774 INFO L125 PetriNetUnfolderBase]: For 1697/1697 co-relation queries the response was YES. [2023-08-23 23:11:04,777 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-23 23:11:04,783 INFO L140 encePairwiseOnDemand]: 188/201 looper letters, 50 selfloop transitions, 18 changer transitions 17/86 dead transitions. [2023-08-23 23:11:04,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 86 transitions, 490 flow [2023-08-23 23:11:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-23 23:11:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-23 23:11:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 866 transitions. [2023-08-23 23:11:04,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43084577114427863 [2023-08-23 23:11:04,786 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 866 transitions. [2023-08-23 23:11:04,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 866 transitions. [2023-08-23 23:11:04,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:04,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 866 transitions. [2023-08-23 23:11:04,789 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-23 23:11:04,791 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-23 23:11:04,792 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-23 23:11:04,792 INFO L175 Difference]: Start difference. First operand has 49 places, 26 transitions, 116 flow. Second operand 10 states and 866 transitions. [2023-08-23 23:11:04,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 86 transitions, 490 flow [2023-08-23 23:11:04,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 452 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-23 23:11:04,798 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 228 flow [2023-08-23 23:11:04,798 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-23 23:11:04,800 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2023-08-23 23:11:04,800 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 228 flow [2023-08-23 23:11:04,801 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-23 23:11:04,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:04,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:04,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:11:04,801 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-23 23:11:04,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1415879366, now seen corresponding path program 2 times [2023-08-23 23:11:04,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:04,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738205060] [2023-08-23 23:11:04,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:05,961 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-23 23:11:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738205060] [2023-08-23 23:11:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738205060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:05,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:11:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333666832] [2023-08-23 23:11:05,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:05,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:11:05,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:05,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:11:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:11:05,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 201 [2023-08-23 23:11:05,964 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-23 23:11:05,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:05,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 201 [2023-08-23 23:11:05,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:06,590 INFO L124 PetriNetUnfolderBase]: 958/1502 cut-off events. [2023-08-23 23:11:06,591 INFO L125 PetriNetUnfolderBase]: For 3095/3095 co-relation queries the response was YES. [2023-08-23 23:11:06,594 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-23 23:11:06,602 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 58 selfloop transitions, 24 changer transitions 11/94 dead transitions. [2023-08-23 23:11:06,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 674 flow [2023-08-23 23:11:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 23:11:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 23:11:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 798 transitions. [2023-08-23 23:11:06,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44112769485903813 [2023-08-23 23:11:06,605 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 798 transitions. [2023-08-23 23:11:06,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 798 transitions. [2023-08-23 23:11:06,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:06,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 798 transitions. [2023-08-23 23:11:06,607 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-23 23:11:06,610 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-23 23:11:06,610 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-23 23:11:06,610 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 228 flow. Second operand 9 states and 798 transitions. [2023-08-23 23:11:06,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 674 flow [2023-08-23 23:11:06,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 662 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:06,619 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 378 flow [2023-08-23 23:11:06,619 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-23 23:11:06,621 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2023-08-23 23:11:06,621 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 378 flow [2023-08-23 23:11:06,621 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-23 23:11:06,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:06,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:06,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:11:06,622 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-23 23:11:06,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1145863986, now seen corresponding path program 3 times [2023-08-23 23:11:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987879230] [2023-08-23 23:11:06,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:06,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:07,455 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-23 23:11:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987879230] [2023-08-23 23:11:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987879230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:07,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:07,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:11:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014931593] [2023-08-23 23:11:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:07,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:11:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:07,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:11:07,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:11:07,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-08-23 23:11:07,458 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-23 23:11:07,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:07,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-08-23 23:11:07,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:07,984 INFO L124 PetriNetUnfolderBase]: 1046/1628 cut-off events. [2023-08-23 23:11:07,984 INFO L125 PetriNetUnfolderBase]: For 5580/5590 co-relation queries the response was YES. [2023-08-23 23:11:07,988 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-23 23:11:07,997 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 67 selfloop transitions, 24 changer transitions 17/109 dead transitions. [2023-08-23 23:11:07,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 109 transitions, 950 flow [2023-08-23 23:11:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 23:11:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 23:11:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 828 transitions. [2023-08-23 23:11:08,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577114427860697 [2023-08-23 23:11:08,000 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 828 transitions. [2023-08-23 23:11:08,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 828 transitions. [2023-08-23 23:11:08,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:08,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 828 transitions. [2023-08-23 23:11:08,003 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-23 23:11:08,005 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-23 23:11:08,006 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-23 23:11:08,006 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 378 flow. Second operand 9 states and 828 transitions. [2023-08-23 23:11:08,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 109 transitions, 950 flow [2023-08-23 23:11:08,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 109 transitions, 896 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-08-23 23:11:08,018 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 474 flow [2023-08-23 23:11:08,018 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-23 23:11:08,019 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-08-23 23:11:08,019 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 474 flow [2023-08-23 23:11:08,020 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-23 23:11:08,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:08,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:08,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:11:08,020 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-23 23:11:08,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:08,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1420670094, now seen corresponding path program 1 times [2023-08-23 23:11:08,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:08,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909550199] [2023-08-23 23:11:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:08,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:08,221 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-23 23:11:08,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:08,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909550199] [2023-08-23 23:11:08,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909550199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:08,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:08,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:11:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874064269] [2023-08-23 23:11:08,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:08,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:11:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:11:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:11:08,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-23 23:11:08,224 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-23 23:11:08,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:08,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-23 23:11:08,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:08,512 INFO L124 PetriNetUnfolderBase]: 782/1270 cut-off events. [2023-08-23 23:11:08,512 INFO L125 PetriNetUnfolderBase]: For 5128/5128 co-relation queries the response was YES. [2023-08-23 23:11:08,514 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-23 23:11:08,519 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 77 selfloop transitions, 4 changer transitions 65/147 dead transitions. [2023-08-23 23:11:08,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 147 transitions, 1449 flow [2023-08-23 23:11:08,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:11:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:11:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2023-08-23 23:11:08,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925373134328358 [2023-08-23 23:11:08,521 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2023-08-23 23:11:08,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2023-08-23 23:11:08,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:08,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2023-08-23 23:11:08,523 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-23 23:11:08,524 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-23 23:11:08,525 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-23 23:11:08,525 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 474 flow. Second operand 5 states and 495 transitions. [2023-08-23 23:11:08,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 147 transitions, 1449 flow [2023-08-23 23:11:08,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 147 transitions, 1429 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-23 23:11:08,533 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 493 flow [2023-08-23 23:11:08,533 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-23 23:11:08,534 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-08-23 23:11:08,534 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 493 flow [2023-08-23 23:11:08,534 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-23 23:11:08,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:08,534 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-23 23:11:08,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:11:08,534 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-23 23:11:08,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1344843097, now seen corresponding path program 1 times [2023-08-23 23:11:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248433561] [2023-08-23 23:11:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:08,737 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-23 23:11:08,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:08,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248433561] [2023-08-23 23:11:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248433561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:08,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:08,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:11:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275000894] [2023-08-23 23:11:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:08,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:11:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:08,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:11:08,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:11:08,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-23 23:11:08,740 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-23 23:11:08,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:08,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-23 23:11:08,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:08,965 INFO L124 PetriNetUnfolderBase]: 408/715 cut-off events. [2023-08-23 23:11:08,965 INFO L125 PetriNetUnfolderBase]: For 2758/2758 co-relation queries the response was YES. [2023-08-23 23:11:08,968 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-23 23:11:08,971 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 84 selfloop transitions, 7 changer transitions 32/124 dead transitions. [2023-08-23 23:11:08,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 124 transitions, 1209 flow [2023-08-23 23:11:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:11:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:11:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2023-08-23 23:11:08,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4917081260364842 [2023-08-23 23:11:08,973 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2023-08-23 23:11:08,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2023-08-23 23:11:08,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:08,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2023-08-23 23:11:08,975 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-23 23:11:08,977 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-23 23:11:08,977 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-23 23:11:08,978 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 493 flow. Second operand 6 states and 593 transitions. [2023-08-23 23:11:08,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 124 transitions, 1209 flow [2023-08-23 23:11:08,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 124 transitions, 1155 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-23 23:11:08,984 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 481 flow [2023-08-23 23:11:08,984 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-23 23:11:08,985 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-08-23 23:11:08,985 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 481 flow [2023-08-23 23:11:08,985 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-23 23:11:08,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:08,986 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-23 23:11:08,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:11:08,986 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-23 23:11:08,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1310864119, now seen corresponding path program 1 times [2023-08-23 23:11:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:08,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693914074] [2023-08-23 23:11:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:09,190 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-23 23:11:09,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693914074] [2023-08-23 23:11:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693914074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:09,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:09,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:11:09,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998682075] [2023-08-23 23:11:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:09,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:11:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:11:09,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:11:09,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-23 23:11:09,193 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-23 23:11:09,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:09,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-23 23:11:09,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:09,410 INFO L124 PetriNetUnfolderBase]: 296/523 cut-off events. [2023-08-23 23:11:09,411 INFO L125 PetriNetUnfolderBase]: For 1833/1833 co-relation queries the response was YES. [2023-08-23 23:11:09,412 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-23 23:11:09,419 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 81 selfloop transitions, 10 changer transitions 12/104 dead transitions. [2023-08-23 23:11:09,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 1008 flow [2023-08-23 23:11:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:11:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:11:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 667 transitions. [2023-08-23 23:11:09,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47405828002842926 [2023-08-23 23:11:09,422 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 667 transitions. [2023-08-23 23:11:09,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 667 transitions. [2023-08-23 23:11:09,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:09,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 667 transitions. [2023-08-23 23:11:09,424 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-23 23:11:09,426 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-23 23:11:09,426 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-23 23:11:09,426 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 481 flow. Second operand 7 states and 667 transitions. [2023-08-23 23:11:09,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 1008 flow [2023-08-23 23:11:09,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 934 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-23 23:11:09,434 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 457 flow [2023-08-23 23:11:09,434 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-23 23:11:09,435 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-08-23 23:11:09,435 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 457 flow [2023-08-23 23:11:09,435 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-23 23:11:09,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:09,435 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-23 23:11:09,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:11:09,436 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-23 23:11:09,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash -169460167, now seen corresponding path program 1 times [2023-08-23 23:11:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:09,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412529355] [2023-08-23 23:11:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:09,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:10,478 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-23 23:11:10,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:10,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412529355] [2023-08-23 23:11:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412529355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:11:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129365031] [2023-08-23 23:11:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:10,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:11:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:10,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:11:10,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:11:10,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 201 [2023-08-23 23:11:10,481 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-23 23:11:10,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:10,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 201 [2023-08-23 23:11:10,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:10,887 INFO L124 PetriNetUnfolderBase]: 446/818 cut-off events. [2023-08-23 23:11:10,887 INFO L125 PetriNetUnfolderBase]: For 2721/2721 co-relation queries the response was YES. [2023-08-23 23:11:10,890 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-23 23:11:10,893 INFO L140 encePairwiseOnDemand]: 190/201 looper letters, 68 selfloop transitions, 29 changer transitions 33/131 dead transitions. [2023-08-23 23:11:10,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 131 transitions, 1242 flow [2023-08-23 23:11:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 23:11:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 23:11:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 759 transitions. [2023-08-23 23:11:10,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41956882255389716 [2023-08-23 23:11:10,896 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 759 transitions. [2023-08-23 23:11:10,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 759 transitions. [2023-08-23 23:11:10,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:10,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 759 transitions. [2023-08-23 23:11:10,898 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-23 23:11:10,901 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-23 23:11:10,902 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-23 23:11:10,902 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 457 flow. Second operand 9 states and 759 transitions. [2023-08-23 23:11:10,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 131 transitions, 1242 flow [2023-08-23 23:11:10,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 131 transitions, 1032 flow, removed 75 selfloop flow, removed 9 redundant places. [2023-08-23 23:11:10,911 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 586 flow [2023-08-23 23:11:10,911 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-23 23:11:10,912 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2023-08-23 23:11:10,912 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 586 flow [2023-08-23 23:11:10,912 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-23 23:11:10,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:10,912 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-23 23:11:10,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:11:10,912 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-23 23:11:10,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1632326081, now seen corresponding path program 2 times [2023-08-23 23:11:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891615200] [2023-08-23 23:11:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:11,951 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-23 23:11:11,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:11,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891615200] [2023-08-23 23:11:11,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891615200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:11,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:11,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-23 23:11:11,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650526375] [2023-08-23 23:11:11,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:11,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-23 23:11:11,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:11,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-23 23:11:11,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-23 23:11:11,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-08-23 23:11:11,954 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-23 23:11:11,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:11,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-08-23 23:11:11,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:12,220 INFO L124 PetriNetUnfolderBase]: 419/769 cut-off events. [2023-08-23 23:11:12,220 INFO L125 PetriNetUnfolderBase]: For 2493/2493 co-relation queries the response was YES. [2023-08-23 23:11:12,222 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-23 23:11:12,224 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 61 selfloop transitions, 14 changer transitions 37/113 dead transitions. [2023-08-23 23:11:12,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 113 transitions, 1064 flow [2023-08-23 23:11:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:11:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:11:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 726 transitions. [2023-08-23 23:11:12,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45149253731343286 [2023-08-23 23:11:12,227 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 726 transitions. [2023-08-23 23:11:12,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 726 transitions. [2023-08-23 23:11:12,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:12,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 726 transitions. [2023-08-23 23:11:12,229 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-23 23:11:12,231 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-23 23:11:12,232 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-23 23:11:12,232 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 586 flow. Second operand 8 states and 726 transitions. [2023-08-23 23:11:12,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 113 transitions, 1064 flow [2023-08-23 23:11:12,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 113 transitions, 1015 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-23 23:11:12,240 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 558 flow [2023-08-23 23:11:12,240 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-23 23:11:12,240 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2023-08-23 23:11:12,240 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 558 flow [2023-08-23 23:11:12,241 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-23 23:11:12,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:12,241 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-23 23:11:12,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:11:12,241 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-23 23:11:12,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash -265911771, now seen corresponding path program 3 times [2023-08-23 23:11:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:12,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109174382] [2023-08-23 23:11:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:13,178 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-23 23:11:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:13,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109174382] [2023-08-23 23:11:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109174382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:13,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:11:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056591523] [2023-08-23 23:11:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:13,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:11:13,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:13,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:11:13,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:11:13,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-08-23 23:11:13,182 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-23 23:11:13,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:13,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-08-23 23:11:13,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:13,552 INFO L124 PetriNetUnfolderBase]: 408/757 cut-off events. [2023-08-23 23:11:13,553 INFO L125 PetriNetUnfolderBase]: For 2481/2481 co-relation queries the response was YES. [2023-08-23 23:11:13,555 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-23 23:11:13,558 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 71 selfloop transitions, 11 changer transitions 26/109 dead transitions. [2023-08-23 23:11:13,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 1014 flow [2023-08-23 23:11:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:11:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:11:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 705 transitions. [2023-08-23 23:11:13,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43843283582089554 [2023-08-23 23:11:13,565 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 705 transitions. [2023-08-23 23:11:13,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 705 transitions. [2023-08-23 23:11:13,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:13,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 705 transitions. [2023-08-23 23:11:13,568 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-23 23:11:13,571 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-23 23:11:13,571 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-23 23:11:13,571 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 558 flow. Second operand 8 states and 705 transitions. [2023-08-23 23:11:13,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 1014 flow [2023-08-23 23:11:13,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 973 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-23 23:11:13,580 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 456 flow [2023-08-23 23:11:13,581 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-23 23:11:13,582 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2023-08-23 23:11:13,582 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 456 flow [2023-08-23 23:11:13,582 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-23 23:11:13,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:13,582 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-23 23:11:13,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 23:11:13,582 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-23 23:11:13,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash -766836589, now seen corresponding path program 4 times [2023-08-23 23:11:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680022114] [2023-08-23 23:11:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:15,255 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-23 23:11:15,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:15,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680022114] [2023-08-23 23:11:15,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680022114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:15,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:15,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-23 23:11:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589108020] [2023-08-23 23:11:15,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:15,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-23 23:11:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:15,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-23 23:11:15,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-08-23 23:11:15,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 201 [2023-08-23 23:11:15,258 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-23 23:11:15,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:15,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 201 [2023-08-23 23:11:15,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:15,729 INFO L124 PetriNetUnfolderBase]: 263/542 cut-off events. [2023-08-23 23:11:15,729 INFO L125 PetriNetUnfolderBase]: For 1676/1676 co-relation queries the response was YES. [2023-08-23 23:11:15,731 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-23 23:11:15,733 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 63 selfloop transitions, 8 changer transitions 37/109 dead transitions. [2023-08-23 23:11:15,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 944 flow [2023-08-23 23:11:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-23 23:11:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-23 23:11:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 894 transitions. [2023-08-23 23:11:15,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4043419267299864 [2023-08-23 23:11:15,736 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 894 transitions. [2023-08-23 23:11:15,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 894 transitions. [2023-08-23 23:11:15,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:15,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 894 transitions. [2023-08-23 23:11:15,738 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-23 23:11:15,741 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-23 23:11:15,742 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-23 23:11:15,742 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 456 flow. Second operand 11 states and 894 transitions. [2023-08-23 23:11:15,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 944 flow [2023-08-23 23:11:15,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 917 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-23 23:11:15,748 INFO L231 Difference]: Finished difference. Result has 80 places, 54 transitions, 428 flow [2023-08-23 23:11:15,748 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-23 23:11:15,749 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 45 predicate places. [2023-08-23 23:11:15,749 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 428 flow [2023-08-23 23:11:15,749 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-23 23:11:15,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:15,750 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-23 23:11:15,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-23 23:11:15,750 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-23 23:11:15,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1744929459, now seen corresponding path program 5 times [2023-08-23 23:11:15,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:15,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658506550] [2023-08-23 23:11:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:15,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:17,418 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-23 23:11:17,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:17,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658506550] [2023-08-23 23:11:17,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658506550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:17,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:17,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-23 23:11:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644261935] [2023-08-23 23:11:17,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:17,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-23 23:11:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:17,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-23 23:11:17,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-08-23 23:11:17,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 201 [2023-08-23 23:11:17,421 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-23 23:11:17,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:17,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 201 [2023-08-23 23:11:17,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:17,818 INFO L124 PetriNetUnfolderBase]: 259/515 cut-off events. [2023-08-23 23:11:17,819 INFO L125 PetriNetUnfolderBase]: For 1571/1571 co-relation queries the response was YES. [2023-08-23 23:11:17,820 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-23 23:11:17,822 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 61 selfloop transitions, 13 changer transitions 22/97 dead transitions. [2023-08-23 23:11:17,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 97 transitions, 852 flow [2023-08-23 23:11:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 23:11:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 23:11:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 760 transitions. [2023-08-23 23:11:17,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201216141514649 [2023-08-23 23:11:17,824 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 760 transitions. [2023-08-23 23:11:17,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 760 transitions. [2023-08-23 23:11:17,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:17,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 760 transitions. [2023-08-23 23:11:17,826 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-23 23:11:17,828 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-23 23:11:17,829 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-23 23:11:17,829 INFO L175 Difference]: Start difference. First operand has 80 places, 54 transitions, 428 flow. Second operand 9 states and 760 transitions. [2023-08-23 23:11:17,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 97 transitions, 852 flow [2023-08-23 23:11:17,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 817 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-08-23 23:11:17,835 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 428 flow [2023-08-23 23:11:17,835 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-23 23:11:17,836 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2023-08-23 23:11:17,836 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 428 flow [2023-08-23 23:11:17,836 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-23 23:11:17,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:17,837 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-23 23:11:17,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-23 23:11:17,837 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-23 23:11:17,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:17,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1405137223, now seen corresponding path program 6 times [2023-08-23 23:11:17,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:17,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309045982] [2023-08-23 23:11:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:17,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:18,800 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-23 23:11:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:18,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309045982] [2023-08-23 23:11:18,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309045982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:18,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:18,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:11:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016286873] [2023-08-23 23:11:18,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:18,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:11:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:11:18,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:11:18,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 201 [2023-08-23 23:11:18,803 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-23 23:11:18,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:18,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 201 [2023-08-23 23:11:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:19,152 INFO L124 PetriNetUnfolderBase]: 245/482 cut-off events. [2023-08-23 23:11:19,153 INFO L125 PetriNetUnfolderBase]: For 1638/1638 co-relation queries the response was YES. [2023-08-23 23:11:19,154 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-23 23:11:19,155 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 46 selfloop transitions, 2 changer transitions 36/85 dead transitions. [2023-08-23 23:11:19,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 773 flow [2023-08-23 23:11:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:11:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:11:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 659 transitions. [2023-08-23 23:11:19,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4098258706467662 [2023-08-23 23:11:19,157 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 659 transitions. [2023-08-23 23:11:19,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 659 transitions. [2023-08-23 23:11:19,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:19,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 659 transitions. [2023-08-23 23:11:19,159 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-23 23:11:19,160 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-23 23:11:19,161 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-23 23:11:19,161 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 428 flow. Second operand 8 states and 659 transitions. [2023-08-23 23:11:19,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 773 flow [2023-08-23 23:11:19,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 85 transitions, 726 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-08-23 23:11:19,166 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 353 flow [2023-08-23 23:11:19,166 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-23 23:11:19,167 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2023-08-23 23:11:19,167 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 353 flow [2023-08-23 23:11:19,167 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-23 23:11:19,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:19,167 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-23 23:11:19,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-23 23:11:19,168 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-23 23:11:19,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1855910753, now seen corresponding path program 7 times [2023-08-23 23:11:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:19,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179783458] [2023-08-23 23:11:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:20,271 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-23 23:11:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:20,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179783458] [2023-08-23 23:11:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179783458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:20,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-23 23:11:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955839526] [2023-08-23 23:11:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:20,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-23 23:11:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-23 23:11:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-23 23:11:20,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 201 [2023-08-23 23:11:20,274 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-23 23:11:20,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:20,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 201 [2023-08-23 23:11:20,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:20,750 INFO L124 PetriNetUnfolderBase]: 263/512 cut-off events. [2023-08-23 23:11:20,751 INFO L125 PetriNetUnfolderBase]: For 1387/1387 co-relation queries the response was YES. [2023-08-23 23:11:20,752 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-23 23:11:20,754 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 47 selfloop transitions, 7 changer transitions 51/106 dead transitions. [2023-08-23 23:11:20,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 903 flow [2023-08-23 23:11:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 23:11:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 23:11:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 764 transitions. [2023-08-23 23:11:20,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4223327805417358 [2023-08-23 23:11:20,756 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 764 transitions. [2023-08-23 23:11:20,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 764 transitions. [2023-08-23 23:11:20,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:20,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 764 transitions. [2023-08-23 23:11:20,766 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-23 23:11:20,768 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-23 23:11:20,769 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-23 23:11:20,769 INFO L175 Difference]: Start difference. First operand has 76 places, 47 transitions, 353 flow. Second operand 9 states and 764 transitions. [2023-08-23 23:11:20,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 903 flow [2023-08-23 23:11:20,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 883 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-23 23:11:20,775 INFO L231 Difference]: Finished difference. Result has 73 places, 35 transitions, 240 flow [2023-08-23 23:11:20,775 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-23 23:11:20,775 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2023-08-23 23:11:20,775 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 35 transitions, 240 flow [2023-08-23 23:11:20,776 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-23 23:11:20,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:20,776 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-23 23:11:20,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-23 23:11:20,776 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-23 23:11:20,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash 541129979, now seen corresponding path program 8 times [2023-08-23 23:11:20,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:20,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403028763] [2023-08-23 23:11:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:21,957 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-23 23:11:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403028763] [2023-08-23 23:11:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403028763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:21,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:21,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-23 23:11:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297795463] [2023-08-23 23:11:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:21,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-23 23:11:21,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-23 23:11:21,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-08-23 23:11:21,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 201 [2023-08-23 23:11:21,961 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-23 23:11:21,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:21,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 201 [2023-08-23 23:11:21,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:22,477 INFO L124 PetriNetUnfolderBase]: 144/318 cut-off events. [2023-08-23 23:11:22,477 INFO L125 PetriNetUnfolderBase]: For 815/815 co-relation queries the response was YES. [2023-08-23 23:11:22,478 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-23 23:11:22,479 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 33 selfloop transitions, 3 changer transitions 52/89 dead transitions. [2023-08-23 23:11:22,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 711 flow [2023-08-23 23:11:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-23 23:11:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-23 23:11:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 908 transitions. [2023-08-23 23:11:22,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41067390321121666 [2023-08-23 23:11:22,481 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 908 transitions. [2023-08-23 23:11:22,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 908 transitions. [2023-08-23 23:11:22,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:22,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 908 transitions. [2023-08-23 23:11:22,483 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-23 23:11:22,485 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-23 23:11:22,486 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-23 23:11:22,486 INFO L175 Difference]: Start difference. First operand has 73 places, 35 transitions, 240 flow. Second operand 11 states and 908 transitions. [2023-08-23 23:11:22,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 711 flow [2023-08-23 23:11:22,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 633 flow, removed 18 selfloop flow, removed 19 redundant places. [2023-08-23 23:11:22,490 INFO L231 Difference]: Finished difference. Result has 67 places, 29 transitions, 167 flow [2023-08-23 23:11:22,490 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-23 23:11:22,490 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-08-23 23:11:22,490 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 29 transitions, 167 flow [2023-08-23 23:11:22,490 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-23 23:11:22,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:22,491 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-23 23:11:22,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-23 23:11:22,491 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-23 23:11:22,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1145765821, now seen corresponding path program 9 times [2023-08-23 23:11:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:22,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313352324] [2023-08-23 23:11:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:22,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:11:22,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:11:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:11:22,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:11:22,600 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:11:22,601 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-23 23:11:22,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-23 23:11:22,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-23 23:11:22,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-23 23:11:22,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-23 23:11:22,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-23 23:11:22,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-23 23:11:22,604 INFO L445 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:22,610 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:11:22,610 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:11:22,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:11:22 BasicIcfg [2023-08-23 23:11:22,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:11:22,659 INFO L158 Benchmark]: Toolchain (without parser) took 30359.94ms. Allocated memory was 343.9MB in the beginning and 950.0MB in the end (delta: 606.1MB). Free memory was 318.9MB in the beginning and 786.2MB in the end (delta: -467.4MB). Peak memory consumption was 140.2MB. Max. memory is 16.0GB. [2023-08-23 23:11:22,659 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 343.9MB. Free memory is still 320.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:11:22,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.12ms. Allocated memory is still 343.9MB. Free memory was 318.4MB in the beginning and 292.3MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-23 23:11:22,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.11ms. Allocated memory is still 343.9MB. Free memory was 292.3MB in the beginning and 289.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-23 23:11:22,660 INFO L158 Benchmark]: Boogie Preprocessor took 60.23ms. Allocated memory is still 343.9MB. Free memory was 289.5MB in the beginning and 286.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:11:22,660 INFO L158 Benchmark]: RCFGBuilder took 790.23ms. Allocated memory is still 343.9MB. Free memory was 286.9MB in the beginning and 287.7MB in the end (delta: -793.7kB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. [2023-08-23 23:11:22,661 INFO L158 Benchmark]: TraceAbstraction took 28855.49ms. Allocated memory was 343.9MB in the beginning and 950.0MB in the end (delta: 606.1MB). Free memory was 287.5MB in the beginning and 786.2MB in the end (delta: -498.7MB). Peak memory consumption was 108.4MB. Max. memory is 16.0GB. [2023-08-23 23:11:22,662 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 343.9MB. Free memory is still 320.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 575.12ms. Allocated memory is still 343.9MB. Free memory was 318.4MB in the beginning and 292.3MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.11ms. Allocated memory is still 343.9MB. Free memory was 292.3MB in the beginning and 289.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 60.23ms. Allocated memory is still 343.9MB. Free memory was 289.5MB in the beginning and 286.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 790.23ms. Allocated memory is still 343.9MB. Free memory was 286.9MB in the beginning and 287.7MB in the end (delta: -793.7kB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. * TraceAbstraction took 28855.49ms. Allocated memory was 343.9MB in the beginning and 950.0MB in the end (delta: 606.1MB). Free memory was 287.5MB in the beginning and 786.2MB in the end (delta: -498.7MB). Peak memory consumption was 108.4MB. 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.5s, 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: 28.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 830 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 830 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 3.0s 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.3s 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.6s 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-23 23:11:22,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...