/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/safe032_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:11:45,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:11:45,937 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:11:45,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:11:45,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:11:45,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:11:45,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:11:45,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:11:45,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:11:45,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:11:45,968 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:11:45,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:11:45,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:11:45,969 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:11:45,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:11:45,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:11:45,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:11:45,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:11:45,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:11:45,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:11:45,971 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:11:45,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:11:45,971 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:11:45,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:11:45,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:11:45,972 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:11:45,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:11:45,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:11:45,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:11:45,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:11:45,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:11:45,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:11:45,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:11:45,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:11:45,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:11:45,974 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:11:46,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:11:46,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:11:46,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:11:46,231 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:11:46,236 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:11:46,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-23 23:11:47,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:11:47,323 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:11:47,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-23 23:11:47,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9946c35b/db230fc79b6d481bbdfc17d60f872864/FLAG1f571164e [2023-08-23 23:11:47,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9946c35b/db230fc79b6d481bbdfc17d60f872864 [2023-08-23 23:11:47,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:11:47,356 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:11:47,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:11:47,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:11:47,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:11:47,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b62cc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47, skipping insertion in model container [2023-08-23 23:11:47,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:11:47,545 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-23 23:11:47,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:11:47,723 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:11:47,730 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-23 23:11:47,736 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:11:47,737 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:11:47,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:11:47,793 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:11:47,794 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:11:47,798 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:11:47,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47 WrapperNode [2023-08-23 23:11:47,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:11:47,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:11:47,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:11:47,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:11:47,803 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:11:47" (1/1) ... [2023-08-23 23:11:47,818 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:11:47" (1/1) ... [2023-08-23 23:11:47,838 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-23 23:11:47,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:11:47,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:11:47,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:11:47,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:11:47,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:11:47,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:11:47,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:11:47,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:11:47,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (1/1) ... [2023-08-23 23:11:47,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:11:47,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:11:47,899 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:11:47,928 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:11:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:11:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:11:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:11:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:11:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:11:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:11:47,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:11:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:11:47,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:11:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:11:47,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:11:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:11:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:11:47,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:11:47,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:11:47,935 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:11:48,025 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:11:48,026 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:11:48,328 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:11:48,470 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:11:48,471 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:11:48,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:11:48 BoogieIcfgContainer [2023-08-23 23:11:48,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:11:48,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:11:48,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:11:48,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:11:48,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:11:47" (1/3) ... [2023-08-23 23:11:48,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b0ceff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:11:48, skipping insertion in model container [2023-08-23 23:11:48,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:47" (2/3) ... [2023-08-23 23:11:48,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b0ceff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:11:48, skipping insertion in model container [2023-08-23 23:11:48,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:11:48" (3/3) ... [2023-08-23 23:11:48,478 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-23 23:11:48,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:11:48,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:11:48,490 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:11:48,530 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:11:48,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-08-23 23:11:48,603 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-23 23:11:48,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:48,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-23 23:11:48,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-08-23 23:11:48,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-08-23 23:11:48,613 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:11:48,622 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-23 23:11:48,624 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-23 23:11:48,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-08-23 23:11:48,657 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-23 23:11:48,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:48,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-23 23:11:48,659 INFO L119 LiptonReduction]: Number of co-enabled transitions 1876 [2023-08-23 23:11:52,145 INFO L134 LiptonReduction]: Checked pairs total: 4825 [2023-08-23 23:11:52,145 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-23 23:11:52,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:11:52,157 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;@79465c30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:11:52,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-23 23:11:52,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:11:52,160 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-23 23:11:52,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:52,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:52,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:52,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:52,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1231917894, now seen corresponding path program 1 times [2023-08-23 23:11:52,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:52,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150509895] [2023-08-23 23:11:52,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:52,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:52,479 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:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150509895] [2023-08-23 23:11:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150509895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:52,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:11:52,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131343598] [2023-08-23 23:11:52,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:52,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:11:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:52,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:11:52,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:11:52,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 202 [2023-08-23 23:11:52,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:52,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:52,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 202 [2023-08-23 23:11:52,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:52,757 INFO L124 PetriNetUnfolderBase]: 1107/1764 cut-off events. [2023-08-23 23:11:52,758 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-23 23:11:52,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3471 conditions, 1764 events. 1107/1764 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8236 event pairs, 249 based on Foata normal form. 0/1668 useless extension candidates. Maximal degree in co-relation 3460. Up to 1219 conditions per place. [2023-08-23 23:11:52,765 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 29 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-23 23:11:52,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 143 flow [2023-08-23 23:11:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:11:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:11:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-23 23:11:52,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066006600660066 [2023-08-23 23:11:52,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-23 23:11:52,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-23 23:11:52,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:52,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-23 23:11:52,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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:52,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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:52,783 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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:52,784 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 307 transitions. [2023-08-23 23:11:52,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 143 flow [2023-08-23 23:11:52,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 23:11:52,787 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-08-23 23:11:52,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-23 23:11:52,790 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-23 23:11:52,790 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-08-23 23:11:52,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:52,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:52,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:52,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:11:52,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:52,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1537841442, now seen corresponding path program 1 times [2023-08-23 23:11:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:52,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588581768] [2023-08-23 23:11:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:53,129 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:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588581768] [2023-08-23 23:11:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588581768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:11:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386728417] [2023-08-23 23:11:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:53,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:11:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:53,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:11:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:11:53,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 202 [2023-08-23 23:11:53,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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:53,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:53,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 202 [2023-08-23 23:11:53,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:53,407 INFO L124 PetriNetUnfolderBase]: 1250/1861 cut-off events. [2023-08-23 23:11:53,407 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-23 23:11:53,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 1861 events. 1250/1861 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8009 event pairs, 256 based on Foata normal form. 36/1897 useless extension candidates. Maximal degree in co-relation 3864. Up to 1596 conditions per place. [2023-08-23 23:11:53,415 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 35 selfloop transitions, 11 changer transitions 0/46 dead transitions. [2023-08-23 23:11:53,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 200 flow [2023-08-23 23:11:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:11:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:11:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-08-23 23:11:53,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504950495049505 [2023-08-23 23:11:53,419 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-08-23 23:11:53,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-08-23 23:11:53,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:53,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-08-23 23:11:53,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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:53,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states 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:53,424 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states 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:53,424 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 364 transitions. [2023-08-23 23:11:53,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 200 flow [2023-08-23 23:11:53,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:11:53,426 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 118 flow [2023-08-23 23:11:53,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2023-08-23 23:11:53,427 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-08-23 23:11:53,428 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 118 flow [2023-08-23 23:11:53,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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:53,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:53,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:53,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:11:53,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:53,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -428445371, now seen corresponding path program 1 times [2023-08-23 23:11:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:53,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292461073] [2023-08-23 23:11:53,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:53,591 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:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292461073] [2023-08-23 23:11:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292461073] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:53,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:53,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:11:53,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021963832] [2023-08-23 23:11:53,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:53,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:11:53,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:53,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:11:53,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:11:53,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 202 [2023-08-23 23:11:53,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states 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:53,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:53,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 202 [2023-08-23 23:11:53,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:53,757 INFO L124 PetriNetUnfolderBase]: 1028/1564 cut-off events. [2023-08-23 23:11:53,757 INFO L125 PetriNetUnfolderBase]: For 569/582 co-relation queries the response was YES. [2023-08-23 23:11:53,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 1564 events. 1028/1564 cut-off events. For 569/582 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6576 event pairs, 356 based on Foata normal form. 67/1631 useless extension candidates. Maximal degree in co-relation 4365. Up to 877 conditions per place. [2023-08-23 23:11:53,764 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 40 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-23 23:11:53,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 259 flow [2023-08-23 23:11:53,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:11:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:11:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-23 23:11:53,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016501650165016 [2023-08-23 23:11:53,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-23 23:11:53,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-23 23:11:53,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:53,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-23 23:11:53,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:53,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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:53,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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:53,768 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 118 flow. Second operand 3 states and 304 transitions. [2023-08-23 23:11:53,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 259 flow [2023-08-23 23:11:53,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 259 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-23 23:11:53,771 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 129 flow [2023-08-23 23:11:53,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-08-23 23:11:53,772 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-23 23:11:53,774 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 129 flow [2023-08-23 23:11:53,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states 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:53,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:53,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:53,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:11:53,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:53,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1686629880, now seen corresponding path program 1 times [2023-08-23 23:11:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706113170] [2023-08-23 23:11:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:54,121 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:54,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:54,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706113170] [2023-08-23 23:11:54,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706113170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:54,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:54,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:11:54,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503930941] [2023-08-23 23:11:54,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:54,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:11:54,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:54,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:11:54,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:11:54,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 202 [2023-08-23 23:11:54,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:54,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:54,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 202 [2023-08-23 23:11:54,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:54,351 INFO L124 PetriNetUnfolderBase]: 1051/1605 cut-off events. [2023-08-23 23:11:54,351 INFO L125 PetriNetUnfolderBase]: For 820/827 co-relation queries the response was YES. [2023-08-23 23:11:54,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4697 conditions, 1605 events. 1051/1605 cut-off events. For 820/827 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6818 event pairs, 114 based on Foata normal form. 10/1615 useless extension candidates. Maximal degree in co-relation 4682. Up to 1181 conditions per place. [2023-08-23 23:11:54,358 INFO L140 encePairwiseOnDemand]: 194/202 looper letters, 43 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-23 23:11:54,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 312 flow [2023-08-23 23:11:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:11:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:11:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2023-08-23 23:11:54,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48514851485148514 [2023-08-23 23:11:54,360 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 392 transitions. [2023-08-23 23:11:54,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 392 transitions. [2023-08-23 23:11:54,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:54,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 392 transitions. [2023-08-23 23:11:54,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:54,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states 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:54,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states 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:54,363 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 129 flow. Second operand 4 states and 392 transitions. [2023-08-23 23:11:54,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 312 flow [2023-08-23 23:11:54,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:11:54,368 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 185 flow [2023-08-23 23:11:54,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2023-08-23 23:11:54,369 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-08-23 23:11:54,369 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 185 flow [2023-08-23 23:11:54,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:54,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:54,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:54,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:11:54,370 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:54,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1141825650, now seen corresponding path program 2 times [2023-08-23 23:11:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:54,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409178266] [2023-08-23 23:11:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:54,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:55,002 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:55,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:55,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409178266] [2023-08-23 23:11:55,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409178266] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:55,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:55,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:11:55,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779952700] [2023-08-23 23:11:55,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:55,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:11:55,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:11:55,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:11:55,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 202 [2023-08-23 23:11:55,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 185 flow. Second operand has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:55,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:55,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 202 [2023-08-23 23:11:55,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:55,271 INFO L124 PetriNetUnfolderBase]: 1053/1610 cut-off events. [2023-08-23 23:11:55,272 INFO L125 PetriNetUnfolderBase]: For 1282/1289 co-relation queries the response was YES. [2023-08-23 23:11:55,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5372 conditions, 1610 events. 1053/1610 cut-off events. For 1282/1289 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6761 event pairs, 250 based on Foata normal form. 16/1626 useless extension candidates. Maximal degree in co-relation 5355. Up to 1180 conditions per place. [2023-08-23 23:11:55,280 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 43 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2023-08-23 23:11:55,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 362 flow [2023-08-23 23:11:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:11:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:11:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 368 transitions. [2023-08-23 23:11:55,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45544554455445546 [2023-08-23 23:11:55,281 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 368 transitions. [2023-08-23 23:11:55,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 368 transitions. [2023-08-23 23:11:55,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:55,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 368 transitions. [2023-08-23 23:11:55,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states 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:55,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states 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:55,284 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states 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:55,284 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 185 flow. Second operand 4 states and 368 transitions. [2023-08-23 23:11:55,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 362 flow [2023-08-23 23:11:55,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 352 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:55,287 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 242 flow [2023-08-23 23:11:55,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2023-08-23 23:11:55,287 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-08-23 23:11:55,287 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 242 flow [2023-08-23 23:11:55,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:55,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:55,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:55,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:11:55,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:55,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1159116530, now seen corresponding path program 1 times [2023-08-23 23:11:55,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:55,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757037811] [2023-08-23 23:11:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:56,035 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:56,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757037811] [2023-08-23 23:11:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757037811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:56,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:56,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:11:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615977897] [2023-08-23 23:11:56,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:56,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:11:56,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:56,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:11:56,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:11:56,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-08-23 23:11:56,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:56,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:56,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-08-23 23:11:56,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:56,371 INFO L124 PetriNetUnfolderBase]: 1381/2121 cut-off events. [2023-08-23 23:11:56,371 INFO L125 PetriNetUnfolderBase]: For 2822/2838 co-relation queries the response was YES. [2023-08-23 23:11:56,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7713 conditions, 2121 events. 1381/2121 cut-off events. For 2822/2838 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9807 event pairs, 46 based on Foata normal form. 37/2158 useless extension candidates. Maximal degree in co-relation 7693. Up to 1286 conditions per place. [2023-08-23 23:11:56,380 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 67 selfloop transitions, 23 changer transitions 0/92 dead transitions. [2023-08-23 23:11:56,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 92 transitions, 681 flow [2023-08-23 23:11:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:11:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:11:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 558 transitions. [2023-08-23 23:11:56,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603960396039604 [2023-08-23 23:11:56,382 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 558 transitions. [2023-08-23 23:11:56,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 558 transitions. [2023-08-23 23:11:56,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:56,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 558 transitions. [2023-08-23 23:11:56,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:56,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:56,387 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:56,387 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 242 flow. Second operand 6 states and 558 transitions. [2023-08-23 23:11:56,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 92 transitions, 681 flow [2023-08-23 23:11:56,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 663 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:56,392 INFO L231 Difference]: Finished difference. Result has 49 places, 57 transitions, 418 flow [2023-08-23 23:11:56,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=418, PETRI_PLACES=49, PETRI_TRANSITIONS=57} [2023-08-23 23:11:56,394 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2023-08-23 23:11:56,394 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 418 flow [2023-08-23 23:11:56,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:56,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:56,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:56,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:11:56,395 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:56,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:56,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1369487132, now seen corresponding path program 2 times [2023-08-23 23:11:56,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359905404] [2023-08-23 23:11:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:56,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:56,768 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:56,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:56,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359905404] [2023-08-23 23:11:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359905404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:56,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:56,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:11:56,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465459014] [2023-08-23 23:11:56,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:56,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:11:56,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:56,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:11:56,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:11:56,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-08-23 23:11:56,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:56,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:56,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-08-23 23:11:56,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:57,146 INFO L124 PetriNetUnfolderBase]: 1561/2404 cut-off events. [2023-08-23 23:11:57,146 INFO L125 PetriNetUnfolderBase]: For 5449/5468 co-relation queries the response was YES. [2023-08-23 23:11:57,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10008 conditions, 2404 events. 1561/2404 cut-off events. For 5449/5468 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11468 event pairs, 230 based on Foata normal form. 38/2442 useless extension candidates. Maximal degree in co-relation 9985. Up to 1357 conditions per place. [2023-08-23 23:11:57,158 INFO L140 encePairwiseOnDemand]: 194/202 looper letters, 61 selfloop transitions, 32 changer transitions 0/95 dead transitions. [2023-08-23 23:11:57,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 828 flow [2023-08-23 23:11:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:11:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:11:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2023-08-23 23:11:57,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47029702970297027 [2023-08-23 23:11:57,160 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 475 transitions. [2023-08-23 23:11:57,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 475 transitions. [2023-08-23 23:11:57,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:57,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 475 transitions. [2023-08-23 23:11:57,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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:57,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:57,163 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:57,163 INFO L175 Difference]: Start difference. First operand has 49 places, 57 transitions, 418 flow. Second operand 5 states and 475 transitions. [2023-08-23 23:11:57,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 828 flow [2023-08-23 23:11:57,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 95 transitions, 813 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:57,169 INFO L231 Difference]: Finished difference. Result has 54 places, 71 transitions, 635 flow [2023-08-23 23:11:57,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=635, PETRI_PLACES=54, PETRI_TRANSITIONS=71} [2023-08-23 23:11:57,170 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2023-08-23 23:11:57,170 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 71 transitions, 635 flow [2023-08-23 23:11:57,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:57,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:57,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:57,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:11:57,170 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:57,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1626248720, now seen corresponding path program 3 times [2023-08-23 23:11:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:57,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327295931] [2023-08-23 23:11:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:57,766 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:57,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:57,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327295931] [2023-08-23 23:11:57,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327295931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:57,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:57,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:11:57,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955560246] [2023-08-23 23:11:57,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:57,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:11:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:11:57,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:11:57,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 202 [2023-08-23 23:11:57,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 71 transitions, 635 flow. Second operand has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:57,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:57,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 202 [2023-08-23 23:11:57,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:58,176 INFO L124 PetriNetUnfolderBase]: 1970/3032 cut-off events. [2023-08-23 23:11:58,176 INFO L125 PetriNetUnfolderBase]: For 11485/11528 co-relation queries the response was YES. [2023-08-23 23:11:58,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13864 conditions, 3032 events. 1970/3032 cut-off events. For 11485/11528 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 15382 event pairs, 185 based on Foata normal form. 88/3120 useless extension candidates. Maximal degree in co-relation 13838. Up to 1517 conditions per place. [2023-08-23 23:11:58,193 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 85 selfloop transitions, 26 changer transitions 2/115 dead transitions. [2023-08-23 23:11:58,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 115 transitions, 1182 flow [2023-08-23 23:11:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:11:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:11:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2023-08-23 23:11:58,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44801980198019803 [2023-08-23 23:11:58,195 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 543 transitions. [2023-08-23 23:11:58,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 543 transitions. [2023-08-23 23:11:58,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:58,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 543 transitions. [2023-08-23 23:11:58,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:58,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:58,198 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:58,198 INFO L175 Difference]: Start difference. First operand has 54 places, 71 transitions, 635 flow. Second operand 6 states and 543 transitions. [2023-08-23 23:11:58,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 115 transitions, 1182 flow [2023-08-23 23:11:58,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 1156 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:58,217 INFO L231 Difference]: Finished difference. Result has 60 places, 84 transitions, 860 flow [2023-08-23 23:11:58,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=60, PETRI_TRANSITIONS=84} [2023-08-23 23:11:58,218 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2023-08-23 23:11:58,218 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 84 transitions, 860 flow [2023-08-23 23:11:58,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:58,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:58,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:58,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:11:58,219 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:58,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash -129999836, now seen corresponding path program 1 times [2023-08-23 23:11:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256629771] [2023-08-23 23:11:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:58,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:58,782 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:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:58,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256629771] [2023-08-23 23:11:58,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256629771] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:58,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:58,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:11:58,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789453432] [2023-08-23 23:11:58,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:58,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:11:58,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:58,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:11:58,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:11:58,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-08-23 23:11:58,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 84 transitions, 860 flow. Second operand has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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:58,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:58,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-08-23 23:11:58,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:59,253 INFO L124 PetriNetUnfolderBase]: 2050/3178 cut-off events. [2023-08-23 23:11:59,254 INFO L125 PetriNetUnfolderBase]: For 15900/15946 co-relation queries the response was YES. [2023-08-23 23:11:59,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15714 conditions, 3178 events. 2050/3178 cut-off events. For 15900/15946 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16566 event pairs, 170 based on Foata normal form. 60/3238 useless extension candidates. Maximal degree in co-relation 15685. Up to 2152 conditions per place. [2023-08-23 23:11:59,268 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 88 selfloop transitions, 52 changer transitions 0/142 dead transitions. [2023-08-23 23:11:59,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 142 transitions, 1588 flow [2023-08-23 23:11:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:11:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:11:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2023-08-23 23:11:59,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46888260254596886 [2023-08-23 23:11:59,270 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 663 transitions. [2023-08-23 23:11:59,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 663 transitions. [2023-08-23 23:11:59,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:59,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 663 transitions. [2023-08-23 23:11:59,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states 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:59,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:59,273 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:59,273 INFO L175 Difference]: Start difference. First operand has 60 places, 84 transitions, 860 flow. Second operand 7 states and 663 transitions. [2023-08-23 23:11:59,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 142 transitions, 1588 flow [2023-08-23 23:11:59,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 142 transitions, 1583 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:59,301 INFO L231 Difference]: Finished difference. Result has 67 places, 108 transitions, 1317 flow [2023-08-23 23:11:59,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1317, PETRI_PLACES=67, PETRI_TRANSITIONS=108} [2023-08-23 23:11:59,302 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2023-08-23 23:11:59,302 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 108 transitions, 1317 flow [2023-08-23 23:11:59,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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:59,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:59,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:59,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:11:59,303 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:59,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash -356656194, now seen corresponding path program 1 times [2023-08-23 23:11:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:59,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734415309] [2023-08-23 23:11:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:59,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:59,966 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:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:59,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734415309] [2023-08-23 23:11:59,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734415309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:59,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:59,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:11:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591683636] [2023-08-23 23:11:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:59,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:11:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:11:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:11:59,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 202 [2023-08-23 23:11:59,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 108 transitions, 1317 flow. Second operand has 9 states, 9 states have (on average 79.66666666666667) internal successors, (717), 9 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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:59,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:59,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 202 [2023-08-23 23:11:59,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:00,666 INFO L124 PetriNetUnfolderBase]: 2414/3802 cut-off events. [2023-08-23 23:12:00,666 INFO L125 PetriNetUnfolderBase]: For 23975/24046 co-relation queries the response was YES. [2023-08-23 23:12:00,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20510 conditions, 3802 events. 2414/3802 cut-off events. For 23975/24046 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 21130 event pairs, 117 based on Foata normal form. 95/3897 useless extension candidates. Maximal degree in co-relation 20478. Up to 2451 conditions per place. [2023-08-23 23:12:00,692 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 112 selfloop transitions, 97 changer transitions 4/215 dead transitions. [2023-08-23 23:12:00,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 215 transitions, 2812 flow [2023-08-23 23:12:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:12:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:12:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 702 transitions. [2023-08-23 23:12:00,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4344059405940594 [2023-08-23 23:12:00,695 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 702 transitions. [2023-08-23 23:12:00,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 702 transitions. [2023-08-23 23:12:00,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:00,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 702 transitions. [2023-08-23 23:12:00,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.75) internal successors, (702), 8 states have internal predecessors, (702), 0 states have call successors, (0), 0 states 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:12:00,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:12:00,699 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:12:00,699 INFO L175 Difference]: Start difference. First operand has 67 places, 108 transitions, 1317 flow. Second operand 8 states and 702 transitions. [2023-08-23 23:12:00,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 215 transitions, 2812 flow [2023-08-23 23:12:00,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 215 transitions, 2746 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-23 23:12:00,763 INFO L231 Difference]: Finished difference. Result has 75 places, 170 transitions, 2424 flow [2023-08-23 23:12:00,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2424, PETRI_PLACES=75, PETRI_TRANSITIONS=170} [2023-08-23 23:12:00,764 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 42 predicate places. [2023-08-23 23:12:00,764 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 170 transitions, 2424 flow [2023-08-23 23:12:00,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.66666666666667) internal successors, (717), 9 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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:12:00,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:00,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:00,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:12:00,765 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:00,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash 441830180, now seen corresponding path program 2 times [2023-08-23 23:12:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805074810] [2023-08-23 23:12:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:00,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:01,339 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:12:01,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805074810] [2023-08-23 23:12:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805074810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:01,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:01,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:12:01,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526081189] [2023-08-23 23:12:01,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:01,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:12:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:01,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:12:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:12:01,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 202 [2023-08-23 23:12:01,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 170 transitions, 2424 flow. Second operand has 9 states, 9 states have (on average 85.66666666666667) internal successors, (771), 9 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:12:01,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:01,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 202 [2023-08-23 23:12:01,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:02,040 INFO L124 PetriNetUnfolderBase]: 2666/4238 cut-off events. [2023-08-23 23:12:02,040 INFO L125 PetriNetUnfolderBase]: For 37689/37766 co-relation queries the response was YES. [2023-08-23 23:12:02,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26067 conditions, 4238 events. 2666/4238 cut-off events. For 37689/37766 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 24485 event pairs, 174 based on Foata normal form. 91/4329 useless extension candidates. Maximal degree in co-relation 26031. Up to 2175 conditions per place. [2023-08-23 23:12:02,066 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 118 selfloop transitions, 139 changer transitions 0/259 dead transitions. [2023-08-23 23:12:02,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 259 transitions, 3912 flow [2023-08-23 23:12:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:12:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:12:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 666 transitions. [2023-08-23 23:12:02,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471004243281471 [2023-08-23 23:12:02,068 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 666 transitions. [2023-08-23 23:12:02,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 666 transitions. [2023-08-23 23:12:02,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:02,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 666 transitions. [2023-08-23 23:12:02,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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:12:02,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:02,071 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:02,071 INFO L175 Difference]: Start difference. First operand has 75 places, 170 transitions, 2424 flow. Second operand 7 states and 666 transitions. [2023-08-23 23:12:02,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 259 transitions, 3912 flow [2023-08-23 23:12:02,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 259 transitions, 3833 flow, removed 37 selfloop flow, removed 1 redundant places. [2023-08-23 23:12:02,153 INFO L231 Difference]: Finished difference. Result has 85 places, 220 transitions, 3628 flow [2023-08-23 23:12:02,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=2359, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3628, PETRI_PLACES=85, PETRI_TRANSITIONS=220} [2023-08-23 23:12:02,154 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2023-08-23 23:12:02,154 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 220 transitions, 3628 flow [2023-08-23 23:12:02,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.66666666666667) internal successors, (771), 9 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:12:02,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:02,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:02,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:12:02,155 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:02,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash 441829932, now seen corresponding path program 2 times [2023-08-23 23:12:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026679035] [2023-08-23 23:12:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:02,501 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:12:02,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:02,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026679035] [2023-08-23 23:12:02,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026679035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:02,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:02,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:12:02,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314430557] [2023-08-23 23:12:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:02,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:12:02,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:02,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:12:02,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:12:02,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 202 [2023-08-23 23:12:02,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 220 transitions, 3628 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:12:02,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:02,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 202 [2023-08-23 23:12:02,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:03,134 INFO L124 PetriNetUnfolderBase]: 2877/4575 cut-off events. [2023-08-23 23:12:03,134 INFO L125 PetriNetUnfolderBase]: For 55986/56086 co-relation queries the response was YES. [2023-08-23 23:12:03,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31268 conditions, 4575 events. 2877/4575 cut-off events. For 55986/56086 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 26909 event pairs, 258 based on Foata normal form. 124/4699 useless extension candidates. Maximal degree in co-relation 31226. Up to 2798 conditions per place. [2023-08-23 23:12:03,164 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 184 selfloop transitions, 118 changer transitions 10/314 dead transitions. [2023-08-23 23:12:03,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 314 transitions, 5635 flow [2023-08-23 23:12:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:12:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:12:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 559 transitions. [2023-08-23 23:12:03,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612211221122112 [2023-08-23 23:12:03,166 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 559 transitions. [2023-08-23 23:12:03,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 559 transitions. [2023-08-23 23:12:03,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:03,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 559 transitions. [2023-08-23 23:12:03,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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:12:03,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:03,169 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:03,169 INFO L175 Difference]: Start difference. First operand has 85 places, 220 transitions, 3628 flow. Second operand 6 states and 559 transitions. [2023-08-23 23:12:03,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 314 transitions, 5635 flow [2023-08-23 23:12:03,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 314 transitions, 5561 flow, removed 37 selfloop flow, removed 0 redundant places. [2023-08-23 23:12:03,296 INFO L231 Difference]: Finished difference. Result has 92 places, 263 transitions, 4841 flow [2023-08-23 23:12:03,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=3566, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4841, PETRI_PLACES=92, PETRI_TRANSITIONS=263} [2023-08-23 23:12:03,297 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 59 predicate places. [2023-08-23 23:12:03,297 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 263 transitions, 4841 flow [2023-08-23 23:12:03,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:12:03,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:03,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:03,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:12:03,298 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:03,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1368846698, now seen corresponding path program 1 times [2023-08-23 23:12:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:03,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969812411] [2023-08-23 23:12:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:03,499 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:12:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969812411] [2023-08-23 23:12:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969812411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:03,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:12:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303289684] [2023-08-23 23:12:03,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:03,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:12:03,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:12:03,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:12:03,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 202 [2023-08-23 23:12:03,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 263 transitions, 4841 flow. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states 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:12:03,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:03,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 202 [2023-08-23 23:12:03,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:04,341 INFO L124 PetriNetUnfolderBase]: 3949/6185 cut-off events. [2023-08-23 23:12:04,341 INFO L125 PetriNetUnfolderBase]: For 74657/74657 co-relation queries the response was YES. [2023-08-23 23:12:04,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41909 conditions, 6185 events. 3949/6185 cut-off events. For 74657/74657 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 37294 event pairs, 745 based on Foata normal form. 28/6213 useless extension candidates. Maximal degree in co-relation 41863. Up to 3198 conditions per place. [2023-08-23 23:12:04,371 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 189 selfloop transitions, 11 changer transitions 145/345 dead transitions. [2023-08-23 23:12:04,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 345 transitions, 6839 flow [2023-08-23 23:12:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:12:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:12:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2023-08-23 23:12:04,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44554455445544555 [2023-08-23 23:12:04,373 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 360 transitions. [2023-08-23 23:12:04,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 360 transitions. [2023-08-23 23:12:04,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:04,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 360 transitions. [2023-08-23 23:12:04,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:12:04,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states 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:12:04,375 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states 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:12:04,375 INFO L175 Difference]: Start difference. First operand has 92 places, 263 transitions, 4841 flow. Second operand 4 states and 360 transitions. [2023-08-23 23:12:04,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 345 transitions, 6839 flow [2023-08-23 23:12:04,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 345 transitions, 6800 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-23 23:12:04,537 INFO L231 Difference]: Finished difference. Result has 96 places, 161 transitions, 2868 flow [2023-08-23 23:12:04,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=4816, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2868, PETRI_PLACES=96, PETRI_TRANSITIONS=161} [2023-08-23 23:12:04,539 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2023-08-23 23:12:04,539 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 161 transitions, 2868 flow [2023-08-23 23:12:04,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states 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:12:04,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:04,539 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:12:04,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 23:12:04,539 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:04,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash -659505280, now seen corresponding path program 1 times [2023-08-23 23:12:04,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:04,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641455143] [2023-08-23 23:12:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:04,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:04,819 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:12:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641455143] [2023-08-23 23:12:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641455143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:12:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457249021] [2023-08-23 23:12:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:04,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:12:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:12:04,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:12:04,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 202 [2023-08-23 23:12:04,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 161 transitions, 2868 flow. Second operand has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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:12:04,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:04,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 202 [2023-08-23 23:12:04,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:05,401 INFO L124 PetriNetUnfolderBase]: 2535/4162 cut-off events. [2023-08-23 23:12:05,402 INFO L125 PetriNetUnfolderBase]: For 54261/54327 co-relation queries the response was YES. [2023-08-23 23:12:05,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28224 conditions, 4162 events. 2535/4162 cut-off events. For 54261/54327 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 25075 event pairs, 413 based on Foata normal form. 86/4248 useless extension candidates. Maximal degree in co-relation 28175. Up to 2800 conditions per place. [2023-08-23 23:12:05,421 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 148 selfloop transitions, 60 changer transitions 14/224 dead transitions. [2023-08-23 23:12:05,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 224 transitions, 4048 flow [2023-08-23 23:12:05,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-23 23:12:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-23 23:12:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 920 transitions. [2023-08-23 23:12:05,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45544554455445546 [2023-08-23 23:12:05,424 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 920 transitions. [2023-08-23 23:12:05,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 920 transitions. [2023-08-23 23:12:05,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:05,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 920 transitions. [2023-08-23 23:12:05,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.0) internal successors, (920), 10 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:12:05,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states 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:12:05,428 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states 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:12:05,428 INFO L175 Difference]: Start difference. First operand has 96 places, 161 transitions, 2868 flow. Second operand 10 states and 920 transitions. [2023-08-23 23:12:05,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 224 transitions, 4048 flow [2023-08-23 23:12:05,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 224 transitions, 3770 flow, removed 31 selfloop flow, removed 9 redundant places. [2023-08-23 23:12:05,495 INFO L231 Difference]: Finished difference. Result has 96 places, 173 transitions, 3038 flow [2023-08-23 23:12:05,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=2628, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3038, PETRI_PLACES=96, PETRI_TRANSITIONS=173} [2023-08-23 23:12:05,495 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2023-08-23 23:12:05,495 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 173 transitions, 3038 flow [2023-08-23 23:12:05,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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:12:05,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:05,496 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:12:05,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-23 23:12:05,496 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:05,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:05,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1095621960, now seen corresponding path program 2 times [2023-08-23 23:12:05,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:05,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311463889] [2023-08-23 23:12:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:06,321 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:12:06,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:06,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311463889] [2023-08-23 23:12:06,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311463889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:06,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:06,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:12:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987542486] [2023-08-23 23:12:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:06,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:12:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:12:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:12:06,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 202 [2023-08-23 23:12:06,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 173 transitions, 3038 flow. Second operand has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states 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:12:06,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:06,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 202 [2023-08-23 23:12:06,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:07,040 INFO L124 PetriNetUnfolderBase]: 2530/4282 cut-off events. [2023-08-23 23:12:07,040 INFO L125 PetriNetUnfolderBase]: For 52088/52144 co-relation queries the response was YES. [2023-08-23 23:12:07,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27783 conditions, 4282 events. 2530/4282 cut-off events. For 52088/52144 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 26777 event pairs, 482 based on Foata normal form. 72/4354 useless extension candidates. Maximal degree in co-relation 27735. Up to 1984 conditions per place. [2023-08-23 23:12:07,060 INFO L140 encePairwiseOnDemand]: 194/202 looper letters, 168 selfloop transitions, 46 changer transitions 13/229 dead transitions. [2023-08-23 23:12:07,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 229 transitions, 4090 flow [2023-08-23 23:12:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:12:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:12:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 698 transitions. [2023-08-23 23:12:07,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4319306930693069 [2023-08-23 23:12:07,063 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 698 transitions. [2023-08-23 23:12:07,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 698 transitions. [2023-08-23 23:12:07,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:07,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 698 transitions. [2023-08-23 23:12:07,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.25) internal successors, (698), 8 states have internal predecessors, (698), 0 states have call successors, (0), 0 states 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:12:07,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:12:07,066 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:12:07,066 INFO L175 Difference]: Start difference. First operand has 96 places, 173 transitions, 3038 flow. Second operand 8 states and 698 transitions. [2023-08-23 23:12:07,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 229 transitions, 4090 flow [2023-08-23 23:12:07,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 229 transitions, 4025 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-23 23:12:07,177 INFO L231 Difference]: Finished difference. Result has 103 places, 180 transitions, 3252 flow [2023-08-23 23:12:07,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3252, PETRI_PLACES=103, PETRI_TRANSITIONS=180} [2023-08-23 23:12:07,177 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 70 predicate places. [2023-08-23 23:12:07,177 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 180 transitions, 3252 flow [2023-08-23 23:12:07,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states 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:12:07,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:07,178 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:12:07,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-23 23:12:07,178 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:07,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:07,178 INFO L85 PathProgramCache]: Analyzing trace with hash 382345698, now seen corresponding path program 3 times [2023-08-23 23:12:07,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:07,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592180470] [2023-08-23 23:12:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:07,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:07,559 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:12:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:07,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592180470] [2023-08-23 23:12:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592180470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:07,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:12:07,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224860122] [2023-08-23 23:12:07,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:07,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:12:07,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:07,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:12:07,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:12:07,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-08-23 23:12:07,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 180 transitions, 3252 flow. Second operand has 7 states, 7 states have (on average 82.28571428571429) internal successors, (576), 7 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:12:07,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:07,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-08-23 23:12:07,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:08,268 INFO L124 PetriNetUnfolderBase]: 2740/4678 cut-off events. [2023-08-23 23:12:08,268 INFO L125 PetriNetUnfolderBase]: For 66903/66980 co-relation queries the response was YES. [2023-08-23 23:12:08,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31260 conditions, 4678 events. 2740/4678 cut-off events. For 66903/66980 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 30478 event pairs, 755 based on Foata normal form. 89/4767 useless extension candidates. Maximal degree in co-relation 31209. Up to 2897 conditions per place. [2023-08-23 23:12:08,288 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 139 selfloop transitions, 79 changer transitions 31/251 dead transitions. [2023-08-23 23:12:08,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 251 transitions, 4686 flow [2023-08-23 23:12:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:12:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:12:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 705 transitions. [2023-08-23 23:12:08,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43626237623762376 [2023-08-23 23:12:08,290 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 705 transitions. [2023-08-23 23:12:08,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 705 transitions. [2023-08-23 23:12:08,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:08,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 705 transitions. [2023-08-23 23:12:08,291 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:12:08,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:12:08,293 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:12:08,293 INFO L175 Difference]: Start difference. First operand has 103 places, 180 transitions, 3252 flow. Second operand 8 states and 705 transitions. [2023-08-23 23:12:08,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 251 transitions, 4686 flow [2023-08-23 23:12:08,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 251 transitions, 4576 flow, removed 38 selfloop flow, removed 3 redundant places. [2023-08-23 23:12:08,396 INFO L231 Difference]: Finished difference. Result has 110 places, 188 transitions, 3562 flow [2023-08-23 23:12:08,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=3142, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3562, PETRI_PLACES=110, PETRI_TRANSITIONS=188} [2023-08-23 23:12:08,397 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 77 predicate places. [2023-08-23 23:12:08,397 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 188 transitions, 3562 flow [2023-08-23 23:12:08,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.28571428571429) internal successors, (576), 7 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:12:08,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:08,398 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:12:08,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-23 23:12:08,398 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:08,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1576504640, now seen corresponding path program 4 times [2023-08-23 23:12:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:08,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768754110] [2023-08-23 23:12:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:08,823 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:12:08,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768754110] [2023-08-23 23:12:08,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768754110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:08,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:08,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:12:08,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126508112] [2023-08-23 23:12:08,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:08,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:12:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:12:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:12:08,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 202 [2023-08-23 23:12:08,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 188 transitions, 3562 flow. Second operand has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states 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:12:08,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:08,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 202 [2023-08-23 23:12:08,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:09,703 INFO L124 PetriNetUnfolderBase]: 2442/4270 cut-off events. [2023-08-23 23:12:09,703 INFO L125 PetriNetUnfolderBase]: For 66085/66146 co-relation queries the response was YES. [2023-08-23 23:12:09,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29344 conditions, 4270 events. 2442/4270 cut-off events. For 66085/66146 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27985 event pairs, 554 based on Foata normal form. 64/4334 useless extension candidates. Maximal degree in co-relation 29290. Up to 2407 conditions per place. [2023-08-23 23:12:09,728 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 124 selfloop transitions, 79 changer transitions 33/237 dead transitions. [2023-08-23 23:12:09,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 237 transitions, 4576 flow [2023-08-23 23:12:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:12:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:12:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 722 transitions. [2023-08-23 23:12:09,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467821782178218 [2023-08-23 23:12:09,730 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 722 transitions. [2023-08-23 23:12:09,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 722 transitions. [2023-08-23 23:12:09,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:09,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 722 transitions. [2023-08-23 23:12:09,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.25) internal successors, (722), 8 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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:12:09,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:12:09,734 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:12:09,734 INFO L175 Difference]: Start difference. First operand has 110 places, 188 transitions, 3562 flow. Second operand 8 states and 722 transitions. [2023-08-23 23:12:09,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 237 transitions, 4576 flow [2023-08-23 23:12:09,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 237 transitions, 4495 flow, removed 31 selfloop flow, removed 3 redundant places. [2023-08-23 23:12:09,881 INFO L231 Difference]: Finished difference. Result has 116 places, 177 transitions, 3493 flow [2023-08-23 23:12:09,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=3481, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3493, PETRI_PLACES=116, PETRI_TRANSITIONS=177} [2023-08-23 23:12:09,882 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 83 predicate places. [2023-08-23 23:12:09,882 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 177 transitions, 3493 flow [2023-08-23 23:12:09,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states 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:12:09,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:09,882 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:12:09,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-23 23:12:09,882 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:09,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1950866515, now seen corresponding path program 1 times [2023-08-23 23:12:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:09,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443687373] [2023-08-23 23:12:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:09,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:09,982 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:12:09,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:09,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443687373] [2023-08-23 23:12:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443687373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:09,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:09,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:12:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801468578] [2023-08-23 23:12:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:09,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:12:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:09,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:12:09,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:12:09,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-08-23 23:12:09,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 177 transitions, 3493 flow. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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:12:09,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:09,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-08-23 23:12:09,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:10,236 INFO L124 PetriNetUnfolderBase]: 832/1548 cut-off events. [2023-08-23 23:12:10,236 INFO L125 PetriNetUnfolderBase]: For 39560/39579 co-relation queries the response was YES. [2023-08-23 23:12:10,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10301 conditions, 1548 events. 832/1548 cut-off events. For 39560/39579 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9162 event pairs, 146 based on Foata normal form. 218/1766 useless extension candidates. Maximal degree in co-relation 10245. Up to 962 conditions per place. [2023-08-23 23:12:10,242 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 138 selfloop transitions, 4 changer transitions 108/251 dead transitions. [2023-08-23 23:12:10,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 251 transitions, 5397 flow [2023-08-23 23:12:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:12:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:12:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-08-23 23:12:10,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782178217821782 [2023-08-23 23:12:10,244 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-08-23 23:12:10,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-08-23 23:12:10,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:10,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-08-23 23:12:10,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states 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:12:10,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:12:10,246 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:12:10,246 INFO L175 Difference]: Start difference. First operand has 116 places, 177 transitions, 3493 flow. Second operand 5 states and 483 transitions. [2023-08-23 23:12:10,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 251 transitions, 5397 flow [2023-08-23 23:12:10,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 251 transitions, 5054 flow, removed 128 selfloop flow, removed 13 redundant places. [2023-08-23 23:12:10,280 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 1996 flow [2023-08-23 23:12:10,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1996, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2023-08-23 23:12:10,280 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 76 predicate places. [2023-08-23 23:12:10,280 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 1996 flow [2023-08-23 23:12:10,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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:12:10,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:10,281 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:12:10,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-23 23:12:10,281 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:10,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash -919642235, now seen corresponding path program 1 times [2023-08-23 23:12:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037105410] [2023-08-23 23:12:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:10,375 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:12:10,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037105410] [2023-08-23 23:12:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037105410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:10,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:10,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:12:10,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027996366] [2023-08-23 23:12:10,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:10,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:12:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:10,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:12:10,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:12:10,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-08-23 23:12:10,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 1996 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:12:10,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:10,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-08-23 23:12:10,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:10,546 INFO L124 PetriNetUnfolderBase]: 363/764 cut-off events. [2023-08-23 23:12:10,546 INFO L125 PetriNetUnfolderBase]: For 18119/18128 co-relation queries the response was YES. [2023-08-23 23:12:10,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5398 conditions, 764 events. 363/764 cut-off events. For 18119/18128 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4166 event pairs, 26 based on Foata normal form. 117/880 useless extension candidates. Maximal degree in co-relation 5354. Up to 373 conditions per place. [2023-08-23 23:12:10,549 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 121 selfloop transitions, 7 changer transitions 56/185 dead transitions. [2023-08-23 23:12:10,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 185 transitions, 3679 flow [2023-08-23 23:12:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:12:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:12:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2023-08-23 23:12:10,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47277227722772275 [2023-08-23 23:12:10,551 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 573 transitions. [2023-08-23 23:12:10,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 573 transitions. [2023-08-23 23:12:10,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:10,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 573 transitions. [2023-08-23 23:12:10,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:12:10,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:10,553 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:10,553 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 1996 flow. Second operand 6 states and 573 transitions. [2023-08-23 23:12:10,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 185 transitions, 3679 flow [2023-08-23 23:12:10,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 185 transitions, 3361 flow, removed 92 selfloop flow, removed 9 redundant places. [2023-08-23 23:12:10,575 INFO L231 Difference]: Finished difference. Result has 105 places, 90 transitions, 1457 flow [2023-08-23 23:12:10,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1457, PETRI_PLACES=105, PETRI_TRANSITIONS=90} [2023-08-23 23:12:10,575 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 72 predicate places. [2023-08-23 23:12:10,575 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 90 transitions, 1457 flow [2023-08-23 23:12:10,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:12:10,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:10,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:10,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-23 23:12:10,576 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:10,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1203055170, now seen corresponding path program 1 times [2023-08-23 23:12:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:10,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492129083] [2023-08-23 23:12:10,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:10,725 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:12:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:10,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492129083] [2023-08-23 23:12:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492129083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:12:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369757123] [2023-08-23 23:12:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:10,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:12:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:10,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:12:10,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:12:10,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-08-23 23:12:10,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 90 transitions, 1457 flow. Second operand has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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:12:10,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:10,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-08-23 23:12:10,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:10,841 INFO L124 PetriNetUnfolderBase]: 190/420 cut-off events. [2023-08-23 23:12:10,841 INFO L125 PetriNetUnfolderBase]: For 6807/6813 co-relation queries the response was YES. [2023-08-23 23:12:10,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 420 events. 190/420 cut-off events. For 6807/6813 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1950 event pairs, 14 based on Foata normal form. 33/452 useless extension candidates. Maximal degree in co-relation 3008. Up to 176 conditions per place. [2023-08-23 23:12:10,843 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 96 selfloop transitions, 10 changer transitions 32/139 dead transitions. [2023-08-23 23:12:10,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 139 transitions, 2537 flow [2023-08-23 23:12:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:12:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:12:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2023-08-23 23:12:10,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45756718528995755 [2023-08-23 23:12:10,844 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2023-08-23 23:12:10,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2023-08-23 23:12:10,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:10,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2023-08-23 23:12:10,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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:12:10,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:10,847 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:10,847 INFO L175 Difference]: Start difference. First operand has 105 places, 90 transitions, 1457 flow. Second operand 7 states and 647 transitions. [2023-08-23 23:12:10,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 139 transitions, 2537 flow [2023-08-23 23:12:10,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 139 transitions, 2350 flow, removed 58 selfloop flow, removed 11 redundant places. [2023-08-23 23:12:10,857 INFO L231 Difference]: Finished difference. Result has 99 places, 75 transitions, 1153 flow [2023-08-23 23:12:10,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1153, PETRI_PLACES=99, PETRI_TRANSITIONS=75} [2023-08-23 23:12:10,857 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 66 predicate places. [2023-08-23 23:12:10,857 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 75 transitions, 1153 flow [2023-08-23 23:12:10,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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:12:10,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:10,858 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] [2023-08-23 23:12:10,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-23 23:12:10,858 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:10,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash -715778504, now seen corresponding path program 1 times [2023-08-23 23:12:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94494115] [2023-08-23 23:12:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:11,897 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:12:11,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:11,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94494115] [2023-08-23 23:12:11,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94494115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:11,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:12:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753255955] [2023-08-23 23:12:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:11,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:12:11,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:11,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:12:11,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:12:11,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 202 [2023-08-23 23:12:11,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 75 transitions, 1153 flow. Second operand has 9 states, 9 states have (on average 80.22222222222223) internal successors, (722), 9 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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:12:11,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:11,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 202 [2023-08-23 23:12:11,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:12,132 INFO L124 PetriNetUnfolderBase]: 133/316 cut-off events. [2023-08-23 23:12:12,132 INFO L125 PetriNetUnfolderBase]: For 3146/3146 co-relation queries the response was YES. [2023-08-23 23:12:12,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 316 events. 133/316 cut-off events. For 3146/3146 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1339 event pairs, 22 based on Foata normal form. 1/317 useless extension candidates. Maximal degree in co-relation 2163. Up to 200 conditions per place. [2023-08-23 23:12:12,134 INFO L140 encePairwiseOnDemand]: 194/202 looper letters, 54 selfloop transitions, 24 changer transitions 20/99 dead transitions. [2023-08-23 23:12:12,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 99 transitions, 1552 flow [2023-08-23 23:12:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:12:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:12:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 594 transitions. [2023-08-23 23:12:12,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4200848656294201 [2023-08-23 23:12:12,135 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 594 transitions. [2023-08-23 23:12:12,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 594 transitions. [2023-08-23 23:12:12,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:12,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 594 transitions. [2023-08-23 23:12:12,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:12:12,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:12,138 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:12,138 INFO L175 Difference]: Start difference. First operand has 99 places, 75 transitions, 1153 flow. Second operand 7 states and 594 transitions. [2023-08-23 23:12:12,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 99 transitions, 1552 flow [2023-08-23 23:12:12,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 99 transitions, 1425 flow, removed 42 selfloop flow, removed 8 redundant places. [2023-08-23 23:12:12,145 INFO L231 Difference]: Finished difference. Result has 96 places, 71 transitions, 1101 flow [2023-08-23 23:12:12,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1101, PETRI_PLACES=96, PETRI_TRANSITIONS=71} [2023-08-23 23:12:12,146 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2023-08-23 23:12:12,146 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 71 transitions, 1101 flow [2023-08-23 23:12:12,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.22222222222223) internal successors, (722), 9 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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:12:12,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:12,146 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] [2023-08-23 23:12:12,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-23 23:12:12,146 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:12,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1595347688, now seen corresponding path program 2 times [2023-08-23 23:12:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:12,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876695365] [2023-08-23 23:12:12,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:12,702 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:12:12,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:12,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876695365] [2023-08-23 23:12:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876695365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:12,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:12,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:12:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146060312] [2023-08-23 23:12:12,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:12,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:12:12,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:12,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:12:12,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:12:12,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 202 [2023-08-23 23:12:12,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 71 transitions, 1101 flow. Second operand has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 0 states 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:12:12,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:12,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 202 [2023-08-23 23:12:12,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:12,945 INFO L124 PetriNetUnfolderBase]: 138/323 cut-off events. [2023-08-23 23:12:12,945 INFO L125 PetriNetUnfolderBase]: For 3135/3135 co-relation queries the response was YES. [2023-08-23 23:12:12,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 323 events. 138/323 cut-off events. For 3135/3135 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1404 event pairs, 10 based on Foata normal form. 2/325 useless extension candidates. Maximal degree in co-relation 2106. Up to 155 conditions per place. [2023-08-23 23:12:12,946 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 42 selfloop transitions, 23 changer transitions 41/107 dead transitions. [2023-08-23 23:12:12,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 107 transitions, 1572 flow [2023-08-23 23:12:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-23 23:12:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-23 23:12:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 867 transitions. [2023-08-23 23:12:12,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292079207920792 [2023-08-23 23:12:12,948 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 867 transitions. [2023-08-23 23:12:12,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 867 transitions. [2023-08-23 23:12:12,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:12,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 867 transitions. [2023-08-23 23:12:12,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 86.7) internal successors, (867), 10 states have internal predecessors, (867), 0 states have call successors, (0), 0 states 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:12:12,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states 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:12:12,950 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states 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:12:12,950 INFO L175 Difference]: Start difference. First operand has 96 places, 71 transitions, 1101 flow. Second operand 10 states and 867 transitions. [2023-08-23 23:12:12,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 107 transitions, 1572 flow [2023-08-23 23:12:12,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 107 transitions, 1466 flow, removed 8 selfloop flow, removed 10 redundant places. [2023-08-23 23:12:12,958 INFO L231 Difference]: Finished difference. Result has 97 places, 59 transitions, 874 flow [2023-08-23 23:12:12,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=874, PETRI_PLACES=97, PETRI_TRANSITIONS=59} [2023-08-23 23:12:12,958 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 64 predicate places. [2023-08-23 23:12:12,958 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 59 transitions, 874 flow [2023-08-23 23:12:12,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 0 states 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:12:12,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:12,958 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] [2023-08-23 23:12:12,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-23 23:12:12,958 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:12,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1596991336, now seen corresponding path program 3 times [2023-08-23 23:12:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:12,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700669374] [2023-08-23 23:12:12,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:12,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:13,285 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:12:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:13,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700669374] [2023-08-23 23:12:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700669374] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:12:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013396571] [2023-08-23 23:12:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:13,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:12:13,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:13,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:12:13,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:12:13,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 202 [2023-08-23 23:12:13,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 59 transitions, 874 flow. Second operand has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:12:13,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:13,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 202 [2023-08-23 23:12:13,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:13,422 INFO L124 PetriNetUnfolderBase]: 107/252 cut-off events. [2023-08-23 23:12:13,423 INFO L125 PetriNetUnfolderBase]: For 2626/2626 co-relation queries the response was YES. [2023-08-23 23:12:13,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 252 events. 107/252 cut-off events. For 2626/2626 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 970 event pairs, 15 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 1692. Up to 135 conditions per place. [2023-08-23 23:12:13,424 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 45 selfloop transitions, 15 changer transitions 26/87 dead transitions. [2023-08-23 23:12:13,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 1239 flow [2023-08-23 23:12:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:12:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:12:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2023-08-23 23:12:13,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521452145214521 [2023-08-23 23:12:13,427 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 548 transitions. [2023-08-23 23:12:13,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 548 transitions. [2023-08-23 23:12:13,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:13,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 548 transitions. [2023-08-23 23:12:13,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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:12:13,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:13,429 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:13,429 INFO L175 Difference]: Start difference. First operand has 97 places, 59 transitions, 874 flow. Second operand 6 states and 548 transitions. [2023-08-23 23:12:13,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 1239 flow [2023-08-23 23:12:13,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 87 transitions, 1131 flow, removed 24 selfloop flow, removed 12 redundant places. [2023-08-23 23:12:13,435 INFO L231 Difference]: Finished difference. Result has 84 places, 53 transitions, 719 flow [2023-08-23 23:12:13,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=719, PETRI_PLACES=84, PETRI_TRANSITIONS=53} [2023-08-23 23:12:13,435 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2023-08-23 23:12:13,435 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 53 transitions, 719 flow [2023-08-23 23:12:13,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:12:13,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:13,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] [2023-08-23 23:12:13,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-23 23:12:13,436 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:13,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1862315098, now seen corresponding path program 4 times [2023-08-23 23:12:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:13,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574860500] [2023-08-23 23:12:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:13,953 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:12:13,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:13,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574860500] [2023-08-23 23:12:13,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574860500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:13,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:13,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:12:13,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495341696] [2023-08-23 23:12:13,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:13,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:12:13,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:13,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:12:13,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:12:13,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-08-23 23:12:13,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 53 transitions, 719 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:12:13,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:13,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-08-23 23:12:13,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:14,164 INFO L124 PetriNetUnfolderBase]: 93/221 cut-off events. [2023-08-23 23:12:14,164 INFO L125 PetriNetUnfolderBase]: For 1914/1914 co-relation queries the response was YES. [2023-08-23 23:12:14,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 221 events. 93/221 cut-off events. For 1914/1914 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 818 event pairs, 16 based on Foata normal form. 1/222 useless extension candidates. Maximal degree in co-relation 1415. Up to 93 conditions per place. [2023-08-23 23:12:14,165 INFO L140 encePairwiseOnDemand]: 194/202 looper letters, 43 selfloop transitions, 17 changer transitions 25/86 dead transitions. [2023-08-23 23:12:14,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 1100 flow [2023-08-23 23:12:14,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:12:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:12:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 609 transitions. [2023-08-23 23:12:14,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4306930693069307 [2023-08-23 23:12:14,167 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 609 transitions. [2023-08-23 23:12:14,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 609 transitions. [2023-08-23 23:12:14,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:14,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 609 transitions. [2023-08-23 23:12:14,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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:12:14,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:14,170 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:14,170 INFO L175 Difference]: Start difference. First operand has 84 places, 53 transitions, 719 flow. Second operand 7 states and 609 transitions. [2023-08-23 23:12:14,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 1100 flow [2023-08-23 23:12:14,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 984 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-08-23 23:12:14,174 INFO L231 Difference]: Finished difference. Result has 82 places, 51 transitions, 653 flow [2023-08-23 23:12:14,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=653, PETRI_PLACES=82, PETRI_TRANSITIONS=51} [2023-08-23 23:12:14,175 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 49 predicate places. [2023-08-23 23:12:14,175 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 51 transitions, 653 flow [2023-08-23 23:12:14,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:12:14,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:14,175 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] [2023-08-23 23:12:14,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-23 23:12:14,175 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:14,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash 50504504, now seen corresponding path program 5 times [2023-08-23 23:12:14,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172429807] [2023-08-23 23:12:14,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:14,546 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:12:14,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:14,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172429807] [2023-08-23 23:12:14,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172429807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:14,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:14,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:12:14,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591286440] [2023-08-23 23:12:14,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:14,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:12:14,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:14,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:12:14,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:12:14,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 202 [2023-08-23 23:12:14,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 51 transitions, 653 flow. Second operand has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:12:14,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:14,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 202 [2023-08-23 23:12:14,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:14,727 INFO L124 PetriNetUnfolderBase]: 82/198 cut-off events. [2023-08-23 23:12:14,727 INFO L125 PetriNetUnfolderBase]: For 1621/1624 co-relation queries the response was YES. [2023-08-23 23:12:14,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 198 events. 82/198 cut-off events. For 1621/1624 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 683 event pairs, 6 based on Foata normal form. 2/199 useless extension candidates. Maximal degree in co-relation 1225. Up to 79 conditions per place. [2023-08-23 23:12:14,728 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 32 selfloop transitions, 11 changer transitions 32/76 dead transitions. [2023-08-23 23:12:14,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 76 transitions, 973 flow [2023-08-23 23:12:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:12:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:12:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2023-08-23 23:12:14,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4335219236209335 [2023-08-23 23:12:14,729 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 613 transitions. [2023-08-23 23:12:14,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 613 transitions. [2023-08-23 23:12:14,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:14,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 613 transitions. [2023-08-23 23:12:14,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states 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:12:14,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:14,731 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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:12:14,731 INFO L175 Difference]: Start difference. First operand has 82 places, 51 transitions, 653 flow. Second operand 7 states and 613 transitions. [2023-08-23 23:12:14,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 76 transitions, 973 flow [2023-08-23 23:12:14,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 902 flow, removed 4 selfloop flow, removed 8 redundant places. [2023-08-23 23:12:14,735 INFO L231 Difference]: Finished difference. Result has 81 places, 38 transitions, 408 flow [2023-08-23 23:12:14,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=81, PETRI_TRANSITIONS=38} [2023-08-23 23:12:14,736 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 48 predicate places. [2023-08-23 23:12:14,736 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 38 transitions, 408 flow [2023-08-23 23:12:14,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:12:14,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:14,736 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] [2023-08-23 23:12:14,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-23 23:12:14,737 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:14,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash -56723640, now seen corresponding path program 6 times [2023-08-23 23:12:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227350994] [2023-08-23 23:12:14,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:14,935 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:12:14,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:14,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227350994] [2023-08-23 23:12:14,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227350994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:14,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:14,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:12:14,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448516017] [2023-08-23 23:12:14,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:14,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:12:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:14,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:12:14,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:12:14,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-08-23 23:12:14,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 38 transitions, 408 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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:12:14,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:14,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-08-23 23:12:14,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:15,012 INFO L124 PetriNetUnfolderBase]: 57/146 cut-off events. [2023-08-23 23:12:15,012 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2023-08-23 23:12:15,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 146 events. 57/146 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 443 event pairs, 24 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 911. Up to 90 conditions per place. [2023-08-23 23:12:15,013 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 30 selfloop transitions, 2 changer transitions 24/57 dead transitions. [2023-08-23 23:12:15,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 57 transitions, 684 flow [2023-08-23 23:12:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:12:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:12:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2023-08-23 23:12:15,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45544554455445546 [2023-08-23 23:12:15,014 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 552 transitions. [2023-08-23 23:12:15,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 552 transitions. [2023-08-23 23:12:15,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:15,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 552 transitions. [2023-08-23 23:12:15,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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:12:15,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:15,016 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:15,016 INFO L175 Difference]: Start difference. First operand has 81 places, 38 transitions, 408 flow. Second operand 6 states and 552 transitions. [2023-08-23 23:12:15,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 57 transitions, 684 flow [2023-08-23 23:12:15,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 57 transitions, 542 flow, removed 25 selfloop flow, removed 18 redundant places. [2023-08-23 23:12:15,018 INFO L231 Difference]: Finished difference. Result has 68 places, 33 transitions, 249 flow [2023-08-23 23:12:15,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=68, PETRI_TRANSITIONS=33} [2023-08-23 23:12:15,019 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 35 predicate places. [2023-08-23 23:12:15,019 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 33 transitions, 249 flow [2023-08-23 23:12:15,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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:12:15,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:15,019 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] [2023-08-23 23:12:15,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-23 23:12:15,019 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:15,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1443490508, now seen corresponding path program 7 times [2023-08-23 23:12:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609886509] [2023-08-23 23:12:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:12:15,359 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:12:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:12:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609886509] [2023-08-23 23:12:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609886509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:12:15,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:12:15,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:12:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264022267] [2023-08-23 23:12:15,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:12:15,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:12:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:12:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:12:15,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:12:15,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 202 [2023-08-23 23:12:15,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 33 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:12:15,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:12:15,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 202 [2023-08-23 23:12:15,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:12:15,475 INFO L124 PetriNetUnfolderBase]: 40/106 cut-off events. [2023-08-23 23:12:15,475 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2023-08-23 23:12:15,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 106 events. 40/106 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 279 event pairs, 9 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 556. Up to 53 conditions per place. [2023-08-23 23:12:15,476 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 26 selfloop transitions, 3 changer transitions 20/50 dead transitions. [2023-08-23 23:12:15,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 50 transitions, 462 flow [2023-08-23 23:12:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:12:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:12:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2023-08-23 23:12:15,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43316831683168316 [2023-08-23 23:12:15,477 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 525 transitions. [2023-08-23 23:12:15,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 525 transitions. [2023-08-23 23:12:15,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:12:15,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 525 transitions. [2023-08-23 23:12:15,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:12:15,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:15,479 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:12:15,479 INFO L175 Difference]: Start difference. First operand has 68 places, 33 transitions, 249 flow. Second operand 6 states and 525 transitions. [2023-08-23 23:12:15,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 50 transitions, 462 flow [2023-08-23 23:12:15,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 430 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-23 23:12:15,481 INFO L231 Difference]: Finished difference. Result has 63 places, 29 transitions, 188 flow [2023-08-23 23:12:15,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=63, PETRI_TRANSITIONS=29} [2023-08-23 23:12:15,481 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2023-08-23 23:12:15,481 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 29 transitions, 188 flow [2023-08-23 23:12:15,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:12:15,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:12:15,481 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] [2023-08-23 23:12:15,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-23 23:12:15,481 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:12:15,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:12:15,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1917721828, now seen corresponding path program 8 times [2023-08-23 23:12:15,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:12:15,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011795115] [2023-08-23 23:12:15,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:12:15,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:12:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:12:15,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:12:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:12:15,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:12:15,583 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:12:15,584 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-23 23:12:15,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-23 23:12:15,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-23 23:12:15,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-23 23:12:15,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-23 23:12:15,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-23 23:12:15,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-23 23:12:15,586 INFO L445 BasicCegarLoop]: Path program histogram: [8, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:12:15,590 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:12:15,590 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:12:15,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:12:15 BasicIcfg [2023-08-23 23:12:15,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:12:15,647 INFO L158 Benchmark]: Toolchain (without parser) took 28288.27ms. Allocated memory was 373.3MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 347.9MB in the beginning and 1.1GB in the end (delta: -786.1MB). Peak memory consumption was 251.9MB. Max. memory is 16.0GB. [2023-08-23 23:12:15,648 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 373.3MB. Free memory was 351.8MB in the beginning and 351.6MB in the end (delta: 247.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:12:15,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.30ms. Allocated memory is still 373.3MB. Free memory was 347.9MB in the beginning and 322.0MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-23 23:12:15,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.71ms. Allocated memory is still 373.3MB. Free memory was 322.0MB in the beginning and 319.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-23 23:12:15,648 INFO L158 Benchmark]: Boogie Preprocessor took 19.97ms. Allocated memory is still 373.3MB. Free memory was 319.1MB in the beginning and 317.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:12:15,648 INFO L158 Benchmark]: RCFGBuilder took 612.81ms. Allocated memory is still 373.3MB. Free memory was 317.0MB in the beginning and 324.3MB in the end (delta: -7.3MB). Peak memory consumption was 34.0MB. Max. memory is 16.0GB. [2023-08-23 23:12:15,648 INFO L158 Benchmark]: TraceAbstraction took 27170.10ms. Allocated memory was 373.3MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 324.3MB in the beginning and 1.1GB in the end (delta: -809.6MB). Peak memory consumption was 226.4MB. Max. memory is 16.0GB. [2023-08-23 23:12:15,649 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.10ms. Allocated memory is still 373.3MB. Free memory was 351.8MB in the beginning and 351.6MB in the end (delta: 247.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 440.30ms. Allocated memory is still 373.3MB. Free memory was 347.9MB in the beginning and 322.0MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.71ms. Allocated memory is still 373.3MB. Free memory was 322.0MB in the beginning and 319.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.97ms. Allocated memory is still 373.3MB. Free memory was 319.1MB in the beginning and 317.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 612.81ms. Allocated memory is still 373.3MB. Free memory was 317.0MB in the beginning and 324.3MB in the end (delta: -7.3MB). Peak memory consumption was 34.0MB. Max. memory is 16.0GB. * TraceAbstraction took 27170.10ms. Allocated memory was 373.3MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 324.3MB in the beginning and 1.1GB in the end (delta: -809.6MB). Peak memory consumption was 226.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, 112 PlacesBefore, 33 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 4825 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1822, independent: 1662, independent conditional: 0, independent unconditional: 1662, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1005, independent: 966, independent conditional: 0, independent unconditional: 966, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1822, independent: 696, independent conditional: 0, independent unconditional: 696, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1005, unknown conditional: 0, unknown unconditional: 1005] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] 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=0, __unbuffered_p1_EAX=1, 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=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, 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: 850]: 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: 852]: 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: 854]: 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, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.0s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 902 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 902 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2771 IncrementalHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 387 mSolverCounterUnsat, 2 mSDtfsCounter, 2771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4841occurred in iteration=12, InterpolantAutomatonStates: 168, 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.4s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 453 NumberOfCodeBlocks, 453 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 5834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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:12:15,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...